Complexity results for three-dimensional orthogonal graph drawing (Q954967)
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: Complexity results for three-dimensional orthogonal graph drawing |
scientific article; zbMATH DE number 5368279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results for three-dimensional orthogonal graph drawing |
scientific article; zbMATH DE number 5368279 |
Statements
Complexity results for three-dimensional orthogonal graph drawing (English)
0 references
18 November 2008
0 references
three-dimensional graph drawing
0 references
orthogonal layout
0 references
computational complexity
0 references
0 references
0.8187118768692017
0 references
0.8186057209968567
0 references
0.8186057209968567
0 references
0.8038609623908997
0 references
