Pages that link to "Item:Q5138511"
From MaRDI portal
The following pages link to A linear-time optimal-message distributed algorithm for minimum spanning trees (Q5138511):
Displaying 4 items.
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632) (← links)
- Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (Q3580979) (← links)
- A Class of Optimal Structures for Node Computations in Message Passing Algorithms (Q5030271) (← links)
- (Q5090922) (← links)