Pages that link to "Item:Q2354407"
From MaRDI portal
The following pages link to A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407):
Displaying 12 items.
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Labelling algorithms for paired-domination problems in block and interval graphs (Q987497) (← links)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
- An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs (Q1933642) (← 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)
- Paired domination on interval and circular-arc graphs (Q2384392) (← links)
- Paired Domination in Graphs (Q3384606) (← links)
- Hamilton cycles in split graphs with large minimum degree (Q4823301) (← links)
- Leaf sector covers with applications on circle graphs (Q6549679) (← links)