Pages that link to "Item:Q3211136"
From MaRDI portal
The following pages link to Polynomial time algorithms on circular-arc overlap graphs (Q3211136):
Displaying 6 items.
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Maximum independent set and maximum clique algorithms for overlap graphs (Q1408815) (← links)
- Computing and counting longest paths on circular-arc graphs in polynomial time (Q2840712) (← links)
- OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS (Q3130162) (← links)
- Efficient algorithms for finding maximum cliques of an overlap graph (Q3471882) (← links)
- (Q4601878) (← links)