There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees (Q1194346)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 64260
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees |
scientific article; zbMATH DE number 64260 |
Statements
There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees (English)
0 references
27 September 1992
0 references
Delaunay triangulation
0 references
time complexity
0 references
planar straight-line graph
0 references
complete Euclidean graph
0 references
spanning tree
0 references
0.8827705383300781
0 references
0.8370311260223389
0 references
