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):
Displayed 5 items.
- 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)