4 citations · 6 across the 2 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2017
Computational Approaches for Zero Forcing and Related Problems
Boris Brimkov, Caleb C. Fast, Illya V. Hicks
In this paper, we propose computational approaches for the zero forcing problem, the connected zero forcing problem, and the problem of forcing a graph within a specified number of…
cs.DM2017★ 2 cited
Graphs with Extremal Connected Forcing Numbers
Boris Brimkov, Caleb C. Fast, Illya V. Hicks
Zero forcing is an iterative graph coloring process where at each discrete time step, a colored vertex with a single uncolored neighbor forces that neighbor to become colored. The…