Some provably hard crossing number problems (Q1176321)
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: Some provably hard crossing number problems |
scientific article; zbMATH DE number 14028
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some provably hard crossing number problems |
scientific article; zbMATH DE number 14028 |
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
0.9122382
0 references
0.9014027
0 references
0.9011444
0 references
0.8861376
0 references
0 references
0 references
