Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications (Q4385200)
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 1140150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications |
scientific article; zbMATH DE number 1140150 |
Statements
Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications (English)
0 references
25 May 1998
0 references
maximum clique
0 references
proper circular arcs
0 references
0.8921258449554443
0 references
0.8856175541877747
0 references
0.8666478395462036
0 references
0.8591384887695312
0 references
