Untangling planar graphs from a specified vertex position-Hard cases (Q534342): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.01.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012957023 / rank | |||
Normal rank | |||
Revision as of 22:25, 19 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
