Pages that link to "Item:Q5060115"
From MaRDI portal
The following pages link to Deferred-query—An efficient approach for problems on interval and circular-arc graphs (Q5060115):
Displayed 4 items.
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- A matrix characterization of interval and proper interval graphs (Q2483137) (← links)
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
- A polynomial algorithm for the k-cluster problem on the interval graphs (Q3439650) (← links)
