Pages that link to "Item:Q4373007"
From MaRDI portal
The following pages link to AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs (Q4373007):
Displaying 12 items.
- A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle (Q911283) (← links)
- Finding maximum cliques on circular-arc graphs (Q1108807) (← links)
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs (Q1123622) (← links)
- Finding a maximum matching in a circular-arc graph (Q1209984) (← links)
- \(k\) best cuts for circular-arc graphs (Q1355722) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135) (← links)
- Perfect circular arc coloring (Q2569164) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- Interval Routing Schemes for Circular-Arc Graphs (Q2979675) (← 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)