Pages that link to "Item:Q990092"

The following pages link to A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092):

Displaying 25 items.

• Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
• Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
• A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
• Distance paired-domination problems on subclasses of chordal graphs (Q1034627) (← links)
• A simple linear time algorithm for the domatic partition problem on strongly chordal graphs (Q1195488) (← links)
• The parallel solution of domination problems on chordal and strongly chordal graphs (Q1331893) (← links)
• Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760) (← links)
• Paired-domination in claw-free graphs with minimum degree at least three (Q1730243) (← links)
• Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs (Q1735675) (← links)
• Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
• Vertices in all minimum paired-dominating sets of block graphs (Q1928534) (← links)
• Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
• Complexity of paired domination in AT-free and planar graphs (Q2166758) (← links)
• A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
• Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
• A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407) (← links)
• A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph (Q2446306) (← links)
• Paired Domination in Graphs (Q3384606) (← links)
• An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs (Q3651563) (← links)
• An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
• An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
• \(k\)-power domination in block graphs (Q5963656) (← links)
• A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)
• Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)
• Leaf sector covers with applications on circle graphs (Q6549679) (← links)