An integer program for positive semidefinite zero forcing in graphs
From MaRDI portal
Cites work
- Computational approaches for zero forcing and related problems
- Effects of vertex degrees on the zero-forcing number and propagation time of a graph
- Expected values of parameters associated with the minimum rank of a graph
- Graph theory with applications
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- Integer Programming Formulation of Traveling Salesman Problems
- Lower bounds for positive semidefinite zero forcing and their applications
- Minimum rank problems
- 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
- On the complexity of failed zero forcing
- On the complexity of the positive semidefinite zero forcing number
- On the error of \textit{a priori} sampling: zero forcing sets and propagation time
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- Positive semidefinite propagation time
- Positive semidefinite zero forcing
- Positive semidefinite zero forcing: complexity and lower bounds
- Propagation time for zero forcing on a graph
- Solving Connected Subgraph Problems in Wildlife Conservation
- Solving the connected dominating set problem and power dominating set problem by integer programming
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
- The minimum rank of symmetric matrices described by a graph: a survey
- Throttling positive semidefinite zero forcing propagation time on graphs
- Throttling zero forcing propagation speed on graphs
- Using separation algorithms to generate mixed integer model reformulations
- Using variants of zero forcing to bound the inertia set of a graph
- Zero forcing parameters and minimum rank problems
- Zero forcing propagation time on oriented graphs
- Zero forcing sets and the minimum rank of graphs
Cited in
(2)
This page was built for publication: An integer program for positive semidefinite zero forcing in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6092625)
