Computing and Combinatorics
DOI10.1007/11533719zbMATH Open1128.90577OpenAlexW4376561447MaRDI QIDQ5717005FDOQ5717005
Authors: 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
Recommendations
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (38)
- Exact and heuristic algorithms for the domination problem
- Power domination in circular-arc graphs
- On the power domination number of graph products
- Power domination in Mycielskian of spiders
- Connected power domination in graphs
- Generalized power domination in claw-free regular graphs
- Power domination in the generalized Petersen graphs
- Power domination number of sunlet graph and other graphs
- Restricted power domination and fault-tolerant power domination on grids
- Domination in Graphs Applied to Electric Power Networks
- On the power domination number of the generalized Petersen graphs
- Capacitated domination: problem complexity and approximation algorithms
- Generalized power domination of graphs
- Power domination in certain chemical structures
- 2-power domination number for Knödel graphs and its application in communication networks
- New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts
- On the \({k}\)-power domination of hypergraphs
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- Algorithms and Complexity of Power Domination in Graphs
- Power domination in planar graphs with small diameter
- Improved algorithms and complexity results for power domination in graphs
- The \(k\)-power domination problem in weighted trees
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- Power domination in regular claw-free graphs
- \(k\)-power domination in block graphs
- Labeling algorithm for power domination problem of trees
- Power domination on triangular grids with triangular and hexagonal shape
- Power domination with bounded time constraints
- Power domination on permutation graphs
- Title not available (Why is that?)
- Disproofs of three conjectures on the power domination of graphs
- Power domination throttling
- Disjoint sets in graphs and its application to electrical networks
- Fundamentals of Computation Theory
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
- Power domination in graphs
- The power edge set problem
This page was built for publication: Computing and Combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717005)
