Computational approaches for zero forcing and related problems
From MaRDI portal
Publication:1631510
DOI10.1016/j.ejor.2018.09.030zbMath1403.90566arXiv1704.02065OpenAlexW2963480971WikidataQ129181248 ScholiaQ129181248MaRDI QIDQ1631510
Boris Brimkov, Caleb C. Fast, Illya V. Hicks
Publication date: 6 December 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.02065
Related Items (14)
Improved Computational Approaches and Heuristics for Zero Forcing ⋮ On the zero blocking number of rectangular, cylindrical, and Möbius grids ⋮ New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts ⋮ An integer program for positive semidefinite zero forcing in graphs ⋮ Restricted power domination and zero forcing problems ⋮ On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme ⋮ Connected power domination in graphs ⋮ Reconfiguration graphs of zero forcing sets ⋮ Blocking zero forcing processes in Cartesian products of graphs ⋮ Sparks of symmetric matrices and their graphs ⋮ Unnamed Item ⋮ Complexity and computation of connected zero forcing ⋮ A computational comparison of compact MILP formulations for the zero forcing number ⋮ Power domination throttling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fractional zero forcing via three-color forcing games
- Proof of a conjecture on the zero forcing number of a graph
- Fast-mixed searching and related problems on graphs
- Combinatorial model and bounds for target set selection
- 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
- Treewidth governs the complexity of target set selection
- Upper bounds on the \(k\)-forcing number of a graph
- Zero forcing number, constrained matchings and strong structural controllability
- Zero forcing propagation time on oriented graphs
- Zero forcing sets and bipartite circulants
- Optimizing over the first Chvátal closure
- Positive semidefinite propagation time
- Solving connected dominating set faster than \(2^n\)
- On minimum rank and zero forcing sets of a graph
- Zero forcing parameters and minimum rank problems
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
- Computational experience with general cutting planes for the set covering problem
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On imposing connectivity constraints in integer programs
- Effects of vertex degrees on the zero-forcing number and propagation time of a graph
- Reverse search for enumeration
- Some results on the target set selection problem
- Logic circuits from zero forcing
- Complexity and computation of connected zero forcing
- Positive semidefinite zero forcing
- Bounds on the connected domination number of a graph
- Zero forcing for sign patterns
- Zero forcing sets and the minimum rank of graphs
- Power domination in graphs
- Iteration Index of a Zero Forcing Set in a Graph
- Metric Dimension and Zero Forcing Number of Two Families of Line Graphs
- An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets
- 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
- Connected Domination and Spanning Trees with Many Leaves
- Domination in Graphs Applied to Electric Power Networks
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Imposing Connectivity Constraints in Forest Planning Models
- Collective dynamics of ‘small-world’ networks
- Solution of a Large-Scale Traveling-Salesman Problem
This page was built for publication: Computational approaches for zero forcing and related problems
