Computing and Combinatorics
From MaRDI portal
Publication:5717005
DOI10.1007/11533719zbMath1128.90577MaRDI QIDQ5717005
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11533719
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Power domination number of sunlet graph and other graphs, Power domination in Mycielskian of spiders, Power domination with bounded time constraints, \(k\)-power domination in block graphs, New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts, Labeling algorithm for power domination problem of trees, 2-power domination number for Knödel graphs and its application in communication networks, Generalized power domination of graphs, Power domination in certain chemical structures, Restricted power domination and fault-tolerant power domination on grids, On the power domination number of the generalized Petersen graphs, Power domination in regular claw-free graphs, Power domination on triangular grids with triangular and hexagonal shape, On the \({k}\)-power domination of hypergraphs, Improved algorithms and complexity results for power domination in graphs, Domination in graphs with bounded propagation: Algorithms, formulations and hardness results, Power domination in circular-arc graphs, Disproofs of three conjectures on the power domination of graphs, Generalized power domination in claw-free regular graphs, Hardness results of connected power domination for bipartite graphs and chordal graphs, Power domination in the generalized Petersen graphs, The \(k\)-power domination problem in weighted trees, Power domination throttling, Capacitated domination: problem complexity and approximation algorithms, Power domination on permutation graphs, Connected power domination in graphs, An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}, On the Power Domination Number of Graph Products, Algorithms and Complexity of Power Domination in Graphs
