A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree (Q3523213)
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: A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree |
scientific article; zbMATH DE number 5318980
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree |
scientific article; zbMATH DE number 5318980 |
Statements
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree (English)
0 references
2 September 2008
0 references
0.8831143975257874
0 references
0.8761303424835205
0 references
0.8697442412376404
0 references
0.8601202368736267
0 references
