A computational comparison of compact MILP formulations for the zero forcing number
From MaRDI portal
Publication:2328106
DOI10.1016/j.dam.2019.03.027zbMath1421.05039OpenAlexW2936631157WikidataQ128030770 ScholiaQ128030770MaRDI QIDQ2328106
Agostinho Agra, Cristina Requejo, Jorge Orestes Cerdeira
Publication date: 9 October 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10773/27228
Related Items
Uses Software
Cites Work
- Unnamed Item
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- A technique for computing the zero forcing number of a graph with a cut-vertex
- Propagation time for zero forcing on a graph
- Upper bounds on the \(k\)-forcing number of a graph
- Zero forcing parameters and minimum rank problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Computational approaches for zero forcing and related problems
- Some bounds on the zero forcing number of a graph
- Logic circuits from zero forcing
- Zero forcing sets and the minimum rank of graphs
- The Zero Forcing Number of Graphs
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- On the complexity of the positive semidefinite zero forcing number