A linear-time algorithm for weighted paired-domination on block graphs
From MaRDI portal
Publication:2168726
DOI10.1007/s10878-021-00767-5zbMath1498.90193OpenAlexW3216977423MaRDI QIDQ2168726
Ta-Yu Mu, Ching-Chi Lin, Cheng-Yu Hsieh
Publication date: 26 August 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00767-5
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
- Paired-domination in inflated graphs
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Labelling algorithms for paired-domination problems in block and interval graphs
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- A survey of selected recent results on total domination in graphs
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs
- Total domination in block graphs
- Topics on domination
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- Computing a minimum paired-dominating set in strongly orderable 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 of trees
- The weighted perfect domination problem and its variants
- An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs
- Independent domination in graphs: A survey and recent results
- Paired-domination problem on distance-hereditary graphs
- The semitotal domination problem in block graphs
- Linear-time algorithms for three domination-based separation problems in block graphs
- Algorithmic aspects of upper paired-domination in graphs
- Algorithmic results on double Roman domination in graphs
- Perfect Roman domination in graphs
- A linear-time algorithm for paired-domination on circular-arc graphs
- A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
- Power domination in block graphs
- An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
- Paired-domination in graphs
This page was built for publication: A linear-time algorithm for weighted paired-domination on block graphs
