Compatible connectivity augmentation of planar disconnected graphs (Q894688)
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: Compatible connectivity augmentation of planar disconnected graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Compatible connectivity augmentation of planar disconnected graphs |
scientific article |
Statements
Compatible connectivity augmentation of planar disconnected graphs (English)
0 references
2 December 2015
0 references
planar graphs
0 references
graph drawing
0 references
Euclidean minimum spanning trees
0 references
0.9659559726715088
0 references
0.8679932951927185
0 references
0.8538909554481506
0 references
0.8528233170509338
0 references
0.8385635018348694
0 references
