Some provably hard crossing number problems (Q1176321)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some provably hard crossing number problems |
scientific article |
Statements
Some provably hard crossing number problems (English)
0 references
25 June 1992
0 references
crossing number problems
0 references
drawing a graph
0 references
pseudolines
0 references
arrangement
0 references
crossing drawing
0 references
polynomial-time algorithm
0 references
NP
0 references
tight bound
0 references
0 references
