Improved Computational Approaches and Heuristics for Zero Forcing
From MaRDI portal
Publication:5084604
DOI10.1287/IJOC.2020.1032OpenAlexW3126613868MaRDI QIDQ5084604FDOQ5084604
Authors: Boris Brimkov, Derek Mikesell, Illya V. Hicks 
Publication date: 28 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.1032
Recommendations
- Computational approaches for zero forcing and related problems
- A computational comparison of compact MILP formulations for the zero forcing number
- Complexity and computation of connected zero forcing
- The zero forcing polynomial of a graph
- Positive semidefinite zero forcing: complexity and lower bounds
Cites Work
- Facets of the three-index assignment polytope
- Collective dynamics of `small-world' networks
- Zero forcing sets and the minimum rank of graphs
- Some results on the target set selection problem
- Complexity classifications of Boolean constraint satisfaction problems
- Facets of the knapsack polytope
- Combinatorial model and bounds for target set selection
- Treewidth governs the complexity of target set selection
- Computation of minimal rank and path cover number for certain graphs
- Domination in Graphs Applied to Electric Power Networks
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Facets of the clique partitioning polytope
- On minimum rank and zero forcing sets of a graph
- Techniques for determining the minimum rank of a small graph
- Zero forcing parameters and minimum rank problems
- Zero forcing number, constrained matchings and strong structural controllability
- The PMU Placement Problem
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- The minimum rank of symmetric matrices described by a graph: a survey
- Facets of the Asymmetric Traveling Salesman Polytope
- Minimum-rank matrices with prescribed graph
- Fast-mixed searching and related problems on graphs
- On the complexity of failed zero forcing
- Restricted power domination and zero forcing problems
- Computational approaches for zero forcing and related problems
- Connected power domination in graphs
- Breaking instance-independent symmetries in exact graph coloring
- Logic circuits from zero forcing
- The zero forcing polynomial of a graph
- Combining linear programming and satisfiability solving for resource planning
- A computational comparison of compact MILP formulations for the zero forcing number
Cited In (2)
Uses Software
This page was built for publication: Improved Computational Approaches and Heuristics for Zero Forcing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084604)
