On the complexity of embedding planar graphs to minimize certain distance measures (Q582079)
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: Publication:582079 |
scientific article; zbMATH DE number 4129996
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of embedding planar graphs to minimize certain distance measures |
scientific article; zbMATH DE number 4129996 |
Statements
On the complexity of embedding planar graphs to minimize certain distance measures (English)
0 references
1990
0 references
embedding
0 references
planar graphs
0 references
outer faces
0 references
0.8441781401634216
0 references
0.8265038132667542
0 references
0.8207333087921143
0 references
0.8146825432777405
0 references
