An integer program for positive semidefinite zero forcing in graphs

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Propagation time for zero forcing on a graph
Lower bounds for positive semidefinite zero forcing and their applications
Zero forcing propagation time on oriented graphs
On the complexity of failed zero forcing
Minimum rank problems
Positive semidefinite propagation time
Expected values of parameters associated with the minimum rank of a graph
Zero forcing parameters and minimum rank problems
The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
The minimum rank of symmetric matrices described by a graph: a survey
On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
Using separation algorithms to generate mixed integer model reformulations
Computational approaches for zero forcing and related problems
Throttling positive semidefinite zero forcing propagation time on graphs
Effects of vertex degrees on the zero-forcing number and propagation time of a graph
On the error of \textit{a priori} sampling: zero forcing sets and propagation time
Positive semidefinite zero forcing
Zero forcing sets and the minimum rank of graphs
Minimum semidefinite rank of outerplanar graphs and the tree cover number
Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
Integer Programming Formulation of Traveling Salesman Problems
Using variants of zero forcing to bound the inertia set of a graph
Positive Semidefinite Zero Forcing: Complexity and Lower Bounds
Solving Connected Subgraph Problems in Wildlife Conservation
On the complexity of the positive semidefinite zero forcing number

This page was built for publication: An integer program for positive semidefinite zero forcing in graphs