Finding maximum cliques on circular-arc graphs (Q1108807)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4068312
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding maximum cliques on circular-arc graphs |
scientific article; zbMATH DE number 4068312 |
Statements
Finding maximum cliques on circular-arc graphs (English)
0 references
1987
0 references
An algorithm is presented that, given the intersection model S of a circular-arc graph G with n vertices and m edges, finds a maximum-sized clique of G in \(O(n^ 2 \log \log n)\) time. The previous best time bound for this problem was \(O(n^ 2 \log n+mn)\).
0 references
circular-arc graph
0 references
clique
0 references
0.9454602599143982
0 references
0.8931958675384521
0 references
0.8912581205368042
0 references
0.8856175541877747
0 references
