Planar embeddability of the vertices of a graph using a fixed point set is NP-hard (Q5301397)
From MaRDI portal
scientific article; zbMATH DE number 5493568
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar embeddability of the vertices of a graph using a fixed point set is NP-hard |
scientific article; zbMATH DE number 5493568 |
Statements
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard (English)
0 references
19 January 2009
0 references
