Pages that link to "Item:Q1108807"
From MaRDI portal
The following pages link to Finding maximum cliques on circular-arc graphs (Q1108807):
Displayed 6 items.
- Two remarks on circular arc graphs (Q675889) (← links)
- A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle (Q911283) (← links)
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs (Q1123622) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- Paths in interval graphs and circular arc graphs (Q1210553) (← links)
- Optimal parallel algorithms on circular-arc graphs (Q1263980) (← links)