Untangling planar graphs from a specified vertex position-Hard cases (Q534342)
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: Untangling planar graphs from a specified vertex position-Hard cases |
scientific article; zbMATH DE number 5895540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Untangling planar graphs from a specified vertex position-Hard cases |
scientific article; zbMATH DE number 5895540 |
Statements
Untangling planar graphs from a specified vertex position-Hard cases (English)
0 references
17 May 2011
0 references
combinatorial geometry
0 references
graph drawing
0 references
planar graphs
0 references
untangling problem
0 references
0 references
0 references
0.8933765
0 references
0.8933765
0 references
0.8845115
0 references
0.8845115
0 references
0.8651898
0 references
0.85770774
0 references
