An \(0(n^{1.5})\) algorithm to color proper circular arcs (Q1824396)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(0(n^{1.5})\) algorithm to color proper circular arcs |
scientific article |
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
