Pages that link to "Item:Q1631510"
From MaRDI portal
The following pages link to Computational approaches for zero forcing and related problems (Q1631510):
Displaying 15 items.
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- On the zero blocking number of rectangular, cylindrical, and Möbius grids (Q2185728) (← links)
- Blocking zero forcing processes in Cartesian products of graphs (Q2197448) (← links)
- A computational comparison of compact MILP formulations for the zero forcing number (Q2328106) (← links)
- Power domination throttling (Q2330105) (← links)
- Restricted power domination and zero forcing problems (Q2424658) (← links)
- Connected power domination in graphs (Q2424811) (← links)
- Reconfiguration graphs of zero forcing sets (Q2686137) (← links)
- Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)
- New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts (Q6065861) (← links)
- An integer program for positive semidefinite zero forcing in graphs (Q6092625) (← links)
- On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme (Q6124433) (← links)
- Sparks of symmetric matrices and their graphs (Q6202068) (← links)
- Solving systems of linear equations through zero forcing set (Q6591655) (← links)
- Minimal zero forcing sets (Q6644905) (← links)
