A linear-time algorithm for weighted paired-domination on block graphs
From MaRDI portal
Recommendations
- Labelling algorithms for paired-domination problems in block and interval graphs
- Vertices in all minimum paired-dominating sets of block graphs
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- A linear-time algorithm for paired-domination on circular-arc graphs
Cites work
- A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
- A linear-time algorithm for paired-domination on circular-arc graphs
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- A survey of selected recent results on total domination in graphs
- Algorithmic aspects of upper paired-domination in graphs
- Algorithmic results on double Roman domination in graphs
- An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs
- An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Computing a minimum paired-dominating set in strongly orderable graphs
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1302196 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- Independent domination in graphs: A survey and recent results
- Labelling algorithms for paired-domination problems in block and interval graphs
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs
- Linear-time algorithms for three domination-based separation problems in block graphs
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
- On computing a minimum secure dominating set in block graphs
- Paired-domination in claw-free graphs with minimum degree at least three
- Paired-domination in graphs
- Paired-domination in inflated graphs
- Paired-domination of trees
- Paired-domination problem on distance-hereditary graphs
- Perfect Roman domination in graphs
- Power domination in block graphs
- The semitotal domination problem in block graphs
- The weighted perfect domination problem and its variants
- Topics on domination
- Total domination in block graphs
- Weighted connected domination and Steiner trees in distance-hereditary graphs
Cited in
(8)- Hardness results and approximation algorithms for (weighted) paired-domination in graphs
- Vertices in all minimum paired-dominating sets of block graphs
- A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs
- A linear time algorithm for the nullity of vertex-weighted block graphs
- scientific article; zbMATH DE number 6000604 (Why is no real title available?)
- scientific article; zbMATH DE number 6531253 (Why is no real title available?)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs
- Labelling algorithms for paired-domination problems in block and interval graphs
This page was built for publication: A linear-time algorithm for weighted paired-domination on block graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168726)
