Finding bounded diameter minimum spanning tree in general graphs (Q2147109)
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: Finding bounded diameter minimum spanning tree in general graphs |
scientific article; zbMATH DE number 7546556
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding bounded diameter minimum spanning tree in general graphs |
scientific article; zbMATH DE number 7546556 |
Statements
Finding bounded diameter minimum spanning tree in general graphs (English)
0 references
22 June 2022
0 references
graph theory
0 references
minimum spanning tree
0 references
bounded diameter minimum spanning tree
0 references
0 references
0 references
0.839724063873291
0 references
0.8362002968788147
0 references
0.8349322080612183
0 references
0.8317402005195618
0 references
