Improved Computational Approaches and Heuristics for Zero Forcing

Zero forcing is a graph coloring process based on the following color change rule: all vertices of a graph G are initially colored either blue or white; in each timestep, a white vertex turns blue ...