Pages that link to "Item:Q1108807"
From MaRDI portal
The following pages link to Finding maximum cliques on circular-arc graphs (Q1108807):
Displaying 15 items.
- Two remarks on circular arc graphs (Q675889) (← links)
- In-place algorithms for computing a largest clique in geometric intersection graphs (Q741534) (← 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)
- Finding a maximum matching in a circular-arc graph (Q1209984) (← links)
- Paths in interval graphs and circular arc graphs (Q1210553) (← links)
- Optimal parallel algorithms on circular-arc graphs (Q1263980) (← links)
- Polynomial time algorithms on circular-arc overlap graphs (Q3211136) (← links)
- Enumerating the maximal cliques of a circle graph (Q3976645) (← links)
- Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph (Q3990622) (← links)
- AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs (Q4373007) (← links)
- A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone (Q4537611) (← links)
- A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs (Q4881292) (← links)
- Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs (Q5689814) (← links)