Computing and Combinatorics

DOI10.1007/11533719zbMath1128.90577OpenAlexW4376561447MaRDI QIDQ5717005

Chung-Shou Liao, Der-Tsai Lee

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (29)

Power domination number of sunlet graph and other graphs ⋮ Hardness results of connected power domination for bipartite graphs and chordal graphs ⋮ Power domination in the generalized Petersen graphs ⋮ On the \({k}\)-power domination of hypergraphs ⋮ Power domination in Mycielskian of spiders ⋮ Power domination on permutation 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 ⋮ Power domination in circular-arc graphs ⋮ Connected power domination in graphs ⋮ 2-power domination number for Knödel graphs and its application in communication networks ⋮ An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} ⋮ Generalized power domination of graphs ⋮ Power domination in certain chemical structures ⋮ Improved algorithms and complexity results for power domination in graphs ⋮ Restricted power domination and fault-tolerant power domination on grids ⋮ Domination in graphs with bounded propagation: Algorithms, formulations and hardness results ⋮ On the power domination number of the generalized Petersen graphs ⋮ On the Power Domination Number of Graph Products ⋮ Power domination with bounded time constraints ⋮ \(k\)-power domination in block graphs ⋮ The \(k\)-power domination problem in weighted trees ⋮ Algorithms and Complexity of Power Domination in Graphs ⋮ Disproofs of three conjectures on the power domination of graphs ⋮ Power domination in regular claw-free graphs ⋮ Power domination on triangular grids with triangular and hexagonal shape ⋮ Power domination throttling ⋮ Capacitated domination: problem complexity and approximation algorithms ⋮ Generalized power domination in claw-free regular graphs

This page was built for publication: Computing and Combinatorics