Untangling planar graphs from a specified vertex position-Hard cases (Q534342): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 01:33, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Untangling planar graphs from a specified vertex position-Hard cases |
scientific article |
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