New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts

DOI10.1002/net.22056zbMath1528.90272MaRDI QIDQ6065861

Illya V. Hicks, Unnamed Author

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

computational complexitygraphinteger programmingcombinatorial optimizationpower dominationzero forcing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Combinatorial model and bounds for target set selection
• Irreversible conversion of graphs
• Restricted power domination and fault-tolerant power domination on grids
• Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• Computational approaches for zero forcing and related problems
• Power domination in circular-arc graphs
• Restricted power domination and zero forcing problems
• Zero forcing sets and the minimum rank of graphs
• A note on power domination in grid graphs
• Power domination in block graphs
• Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
• On the Approximability of Influence in Social Networks
• Domination in Graphs Applied to Electric Power Networks
• Collective dynamics of ‘small-world’ networks
• The PMU Placement Problem
• Computing and Combinatorics

This page was built for publication: New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts