The complexity of detecting crossingfree configurations in the plane (Q1317860): Difference between revisions
From MaRDI portal
Latest revision as of 10:29, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The complexity of detecting crossingfree configurations in the plane |
scientific article |
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