Content deleted Content added
Changed lower bound of the time complexity according to the cited article: David Peleg and Vitaly Rubinovich “A near tight lower bound on the time complexity of Distributed Minimum Spanning Tree Construction.“. |
Typo in 'marks' |
||
Line 52:
For level-0 fragments, each awakened node will do the following:
# Choose its minimum-weight incident edge and
# Send a message via the branch edge to notify the node on the other side.
# Wait for a message from the other end of the edge.
| |||