A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction (Q2706118)
From MaRDI portal
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
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction (English)
0 references
19 March 2001
0 references
distributed algorithm
0 references
minimum weight spanning tree
0 references
lower bound
0 references
