Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees (Q3474882)
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: Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees |
scientific article; zbMATH DE number 4143428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees |
scientific article; zbMATH DE number 4143428 |
Statements
Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees (English)
0 references
1990
0 references
distributed algorithms
0 references
synchronous and asynchronous networks
0 references
minimum spanning trees
0 references
communication complexity
0 references
0.8715563416481018
0 references
0.8676981329917908
0 references
