Computing and Combinatorics
From MaRDI portal
Publication:5717005
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)
Recommendations
Cited in
(39)- Generalized power domination of graphs
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- Connected power domination in graphs
- On the power domination number of graph products
- 2-power domination number for Knödel graphs and its application in communication networks
- Exact and heuristic algorithms for the domination problem
- On the \({k}\)-power domination of hypergraphs
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts
- Generalized power domination in claw-free regular graphs
- Power domination in regular claw-free graphs
- Failed power domination on graphs
- The power edge set problem
- Improved algorithms and complexity results for power domination in graphs
- Power domination on triangular grids with triangular and hexagonal shape
- Disjoint sets in graphs and its application to electrical networks
- Power domination in graphs
- On the power domination number of the generalized Petersen graphs
- Fundamentals of Computation Theory
- Power domination in certain chemical structures
- \(k\)-power domination in block graphs
- The \(k\)-power domination problem in weighted trees
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- Power domination with bounded time constraints
- Power domination on permutation graphs
- Power domination in Mycielskian of spiders
- Power domination in circular-arc graphs
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
- Power domination in the generalized Petersen graphs
- scientific article; zbMATH DE number 7493307 (Why is no real title available?)
- Power domination in planar graphs with small diameter
- Capacitated domination: problem complexity and approximation algorithms
- Restricted power domination and fault-tolerant power domination on grids
- Power domination number of sunlet graph and other graphs
- Disproofs of three conjectures on the power domination of graphs
- Labeling algorithm for power domination problem of trees
- Domination in Graphs Applied to Electric Power Networks
- Power domination throttling
- Algorithms and complexity of power domination in graphs
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)
