Weak power domination

DOI10.1007/S10479-025-06831-1MaRDI QIDQ7317437zbMATH OpenFDO

Authors Jean-François Dumollard, Sulian Le Bozec-Chiffoleau, José Neto

Publication date 24 August 2026

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-025-06831-1

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Linear programming (90C05) Integer programming (90C10)

Cites work

• Collective dynamics of `small-world' networks
• Computational approaches for zero forcing and related problems
• Domination in Graphs Applied to Electric Power Networks
• Effects of vertex degrees on the zero-forcing number and propagation time of a graph
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3666828 (Why is no real title available?)
• scientific article; zbMATH DE number 125465 (Why is no real title available?)
• scientific article; zbMATH DE number 6737879 (Why is no real title available?)
• Improved algorithms and complexity results for power domination in graphs
• New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts
• Observability of power systems with optimal PMU placement
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• Power domination in graphs
• Power domination in graphs

This page was built for publication: Weak power domination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7317437)