The complexity of detecting crossingfree configurations in the plane (Q1317860)
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 536861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of detecting crossingfree configurations in the plane |
scientific article; zbMATH DE number 536861 |
Statements
The complexity of detecting crossingfree configurations in the plane (English)
0 references
22 March 1994
0 references
algorithmic complexity
0 references
planar layouts
0 references
geometry
0 references
computational complexity
0 references
crossingfree spanning trees
0 references
0.7721692323684692
0 references
0.7721459269523621
0 references
0.7717280983924866
0 references
0.7596204876899719
0 references
0.7578771114349365
0 references
