Fixed edge-length graph drawing is NP-hard (Q1813977): Difference between revisions
From MaRDI portal
Latest revision as of 08:31, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fixed edge-length graph drawing is NP-hard |
scientific article |
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