2 citations · 4 across the 10 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2025
On the number of asynchronous attractors in AND-NOT Boolean networks
Van-Giang Trinh, Samuel Pastva, Jordan Rozum +2
Boolean Networks (BNs) describe the time evolution of binary states using logic functions on the nodes of a network. They are fundamental models for complex discrete dynamical syst…
cs.DM2024
The ultrametric backbone is the union of all minimum spanning forests
Jordan C Rozum, Luis M Rocha
Minimum spanning trees and forests are powerful sparsification techniques that remove cycles from weighted graphs to minimize total edge weight while preserving node connectivity.…