Planar embeddability of the vertices of a graph using a fixed point set is NP-hard (Q5301397)
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: Planar embeddability of the vertices of a graph using a fixed point set is NP-hard |
scientific article; zbMATH DE number 5493568
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8854687213897705
0 references
0.862959086894989
0 references
0.8571174144744873
0 references
0.8113267421722412
0 references
0.8082260489463806
0 references
