Pages that link to "Item:Q1933642"
From MaRDI portal
The following pages link to An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs (Q1933642):
Displaying 8 items.
- Permutation bigraphs and interval containments (Q401140) (← links)
- Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← 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)
- Paired Domination in Graphs (Q3384606) (← links)
