The complexity of bendless three-dimensional orthogonal graph drawing (Q4910552)
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: The complexity of bendless three-dimensional orthogonal graph drawing |
scientific article; zbMATH DE number 6146096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of bendless three-dimensional orthogonal graph drawing |
scientific article; zbMATH DE number 6146096 |
Statements
The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing (English)
0 references
19 March 2013
0 references
embeddings of 3-regular graphs
0 references
0.9287638068199158
0 references
0.8187118768692017
0 references
0.8133659958839417
0 references
0.8133659958839417
0 references
