Linear-time algorithm for paired-domination on distance-hereditary graphs
From MaRDI portal
Publication:6113862
DOI10.1007/978-3-031-22105-7_32MaRDI QIDQ6113862
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Paired-domination in inflated graphs
- Improved algorithms and complexity results for power domination in graphs
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- Efficient edge domination problems in graphs
- Weighted domination of cocomparability graphs
- Paired-domination of trees
- An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs
- Paired-domination problem on distance-hereditary graphs
- Infectious power domination of hypergraphs
- Perfectly relating the domination, total domination, and paired domination numbers of a graph
- A linear-time algorithm for paired-domination on circular-arc graphs
- A decomposition approach for solving a broadcast domination network design problem
- A (2+ε)-Approximation Scheme for Minimum Domination on Circle Graphs
- Paired-domination in graphs
- Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs
- Domination in Graphs Applied to Electric Power Networks
- A dominating-set-based routing scheme in ad hoc wireless networks
- Domination in distance-hereditary graphs
- Complexity of paired domination in at-free and planar graphs
This page was built for publication: Linear-time algorithm for paired-domination on distance-hereditary graphs
