Pages that link to "Item:Q436669"
From MaRDI portal
The following pages link to A distributed approximation algorithm for the minimum degree minimum weight spanning trees (Q436669):
Displaying 10 items.
- Self-stabilizing minimum degree spanning tree within one from the optimal degree (Q635330) (← links)
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (Q932651) (← links)
- A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms (Q2456363) (← links)
- Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (Q3580979) (← links)
- (Q4250790) (← links)
- A linear-time optimal-message distributed algorithm for minimum spanning trees (Q5138511) (← links)
- Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs (Q5197676) (← links)
- From sequential layers to distributed processes (Q5348853) (← links)
- Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds (Q5700572) (← links)
- Minimum-weight spanning tree algorithms. A survey and empirical study (Q5953166) (← links)
