A faster distributed protocol for constructing a minimum spanning tree (Q856405)
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 faster distributed protocol for constructing a minimum spanning tree |
scientific article; zbMATH DE number 5078606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster distributed protocol for constructing a minimum spanning tree |
scientific article; zbMATH DE number 5078606 |
Statements
A faster distributed protocol for constructing a minimum spanning tree (English)
0 references
7 December 2006
0 references
minimum spanning tree
0 references
distributed computing
0 references
0.9962769746780396
0 references
0.8643482327461243
0 references
0.8643098473548889
0 references
0.8642140030860901
0 references
0.8588745594024658
0 references
