Pages that link to "Item:Q2366239"
From MaRDI portal
The following pages link to Fast algorithms for the dominating set problem on permutation graphs (Q2366239):
Displayed 5 items.
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569) (← links)
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs (Q1827836) (← links)
- Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)