Pages that link to "Item:Q4290917"
From MaRDI portal
The following pages link to Some Efficient Algorithms for Permutation Graphs (Q4290917):
Displaying 4 items.
- 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)
- Connected domination and dominating clique in trapezoid graphs (Q1962037) (← links)
