Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
From MaRDI portal
(Redirected from Publication:386432)
Recommendations
- A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
- Computing a minimum paired-dominating set in strongly orderable graphs
- Labelling algorithms for paired-domination problems in block and interval graphs
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 2086689 (Why is no real title available?)
- scientific article; zbMATH DE number 5054162 (Why is no real title available?)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
- Characterizations of strongly chordal graphs
- Characterizations of trees with equal paired and double domination numbers
- Classes of bipartite graphs related to chordal graphs
- Domination in convex and chordal bipartite graphs
- Domination, independent domination, and duality in strongly chordal graphs
- Labeling algorithms for domination problems in sun-free chordal graphs
- Labelling algorithms for paired-domination problems in block and interval graphs
- Paired domination on interval and circular-arc graphs
- Paired-domination in generalized claw-free graphs
- Paired-domination in graphs
- Paired-domination of trees
- Perfect Elimination and Chordal Bipartite Graphs
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- Trees with equal domination and paired-domination numbers.
- Trees with large paired-domination number
Cited in
(22)- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- Paired-domination problem on distance-hereditary graphs
- Large hypertree width for sparse random hypergraphs
- Linear algorithms for red and blue domination in convex bipartite graphs
- Algorithmic aspects of upper paired-domination in graphs
- Computing a minimum paired-dominating set in strongly orderable graphs
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- Complexity of paired domination in at-free and planar graphs
- Complexity of distance paired-domination problem in graphs
- A min-max property of chordal bipartite graphs with applications
- A linear-time algorithm for weighted paired-domination on block graphs
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite 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
- Upper paired domination versus upper domination
- Complexity of paired domination in AT-free and planar graphs
- Labelling algorithms for paired-domination problems in block and interval graphs
- Paired domination versus domination and packing number in graphs
- Approximation hardness of domination problems on generalized convex graphs
- The Outer-Paired Domination of Graphs
- Complexity of the paired domination subdivision problem
- An optimal algorithm to find minimum \(k\)-hop connected dominating set of permutation graphs
This page was built for publication: Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386432)
