Fixed edge-length graph drawing is NP-hard (Q1813977)
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: Fixed edge-length graph drawing is NP-hard |
scientific article; zbMATH DE number 5490
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fixed edge-length graph drawing is NP-hard |
scientific article; zbMATH DE number 5490 |
Statements
Fixed edge-length graph drawing is NP-hard (English)
0 references
25 June 1992
0 references
computational geometry
0 references
graph layout
0 references
planar graph
0 references
2-connected graph
0 references
0 references
0.85966957
0 references
0.8453132
0 references
0.8369564
0 references
0.8369564
0 references
0 references
0 references
0.8291465
0 references
0.8291465
0 references
