An edge-swap heuristic for finding dense spanning trees (Q5225517)
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 7084000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An edge-swap heuristic for finding dense spanning trees |
scientific article; zbMATH DE number 7084000 |
Statements
An edge-swap heuristic for finding dense spanning trees (English)
0 references
22 July 2019
0 references
computational results
0 references
randomly generated graphs
0 references
0.92605245
0 references
0.9147717
0 references
0.9090428
0 references
0.9090424
0 references
0.89680916
0 references
0 references
0.8918427
0 references
0.88940424
0 references
