A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction (Q2706118)
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 near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction |
scientific article |
Statements
19 March 2001
0 references
distributed algorithm
0 references
minimum weight spanning tree
0 references
lower bound
0 references
A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction (English)
0 references
