Computing Euclidean maximum spanning trees (Q911288)
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 4141507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Euclidean maximum spanning trees |
scientific article; zbMATH DE number 4141507 |
Statements
Computing Euclidean maximum spanning trees (English)
0 references
1990
0 references
spanning trees
0 references
furthest-neighbor graph
0 references
clusters
0 references
diameter-partitioning
0 references
0 references
0.8570136427879333
0 references
0.8557345867156982
0 references
0.8494890928268433
0 references
0.8487907648086548
0 references
