An \(0(n^{1.5})\) algorithm to color proper circular arcs (Q1824396)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An \(0(n^{1.5})\) algorithm to color proper circular arcs |
scientific article; zbMATH DE number 4117865
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(0(n^{1.5})\) algorithm to color proper circular arcs |
scientific article; zbMATH DE number 4117865 |
Statements
An \(0(n^{1.5})\) algorithm to color proper circular arcs (English)
0 references
1989
0 references
proper circular arcs
0 references
coloring
0 references
NP-hard
0 references
shortest path problem
0 references
binary search
0 references
Teng and Tucker's algorithm
0 references
0.9408617
0 references
0 references
0.90052354
0 references
0.8935688
0 references
0.87474024
0 references
0.87437874
0 references
0.8688049
0 references
0.85667133
0 references
0.8527446
0 references
0.84892607
0 references
