Paired-domination problem on distance-hereditary graphs
From MaRDI portal
Publication:2006943
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) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
- Distance paired-domination problems on subclasses of chordal graphs
- Labelling algorithms for paired-domination problems in block and interval 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
Cites work
- scientific article; zbMATH DE number 3648727 (Why is no real title available?)
- scientific article; zbMATH DE number 3919840 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1302196 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (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?)
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- A linear algorithm for the domination number of a tree
- 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
- Algorithmic aspects of upper paired-domination in graphs
- An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
- Approximation algorithms for NP-hard problems.
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Capacitated domination: problem complexity and approximation algorithms
- Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs
- Clustering and domination in perfect graphs
- Completely separable graphs
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Distance-hereditary graphs
- Dominating Sets in Chordal Graphs
- Dominating sets for split and bipartite graphs
- Dominating sets in perfect graphs
- Domination in distance-hereditary graphs
- Domination in permutation graphs
- Domination, independent domination, and duality in strongly chordal graphs
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Independent domination in chordal graphs
- Labeling algorithms for domination problems in sun-free chordal graphs
- Labelling algorithms for paired-domination problems in block and interval graphs
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Linear time algorithms on circular-arc graphs
- New geometric representations and domination problems on tolerance and multitolerance graphs
- On the Algorithmic Complexity of Total Domination
- Paired domination in graphs: a survey and recent results
- Paired-domination in claw-free graphs with minimum degree at least three
- Paired-domination in graphs
- Paired-domination of trees
- Perfectly relating the domination, total domination, and paired domination numbers of a graph
- Permutation graphs: Connected domination and Steiner trees
- Steiner trees, connected domination and strongly chordal graphs
- The complexity of domination problems in circle graphs
- Topics on domination
- Total domination in interval graphs
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- Weighted efficient domination for P₅-free and P₆-free graphs
Cited in
(12)- Grouped domination parameterized by vertex cover, twin cover, and beyond
- Linear-time algorithm for paired-domination on distance-hereditary graphs
- Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs
- Computing a minimum paired-dominating set in strongly orderable graphs
- Complexity of paired domination in at-free and planar graphs
- Complexity of distance paired-domination problem in graphs
- Grouped domination parameterized by vertex cover, twin cover, and beyond
- A linear-time algorithm for weighted paired-domination on block graphs
- Distance paired-domination problems on subclasses of chordal graphs
- Complexity of paired domination in AT-free and planar graphs
- Unique response Roman domination: complexity and algorithms
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
This page was built for publication: Paired-domination problem on distance-hereditary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2006943)
