Pages that link to "Item:Q3580979"
From MaRDI portal
The following pages link to Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (Q3580979):
Displaying 14 items.
- Local MST computation with short advice (Q613116) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- A fast distributed approximation algorithm for minimum spanning trees (Q1954259) (← links)
- Redundancy in distributed proofs (Q2025853) (← links)
- Single-source shortest paths in the CONGEST model with improved bounds (Q2166365) (← links)
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms (Q2456363) (← links)
- Low-congestion shortcuts without embedding (Q2657278) (← links)
- (Q5090922) (← links)
- Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
- Randomized Lower Bound for Distributed Spanning-Tree Verification (Q5496155) (← links)
- (Q5743466) (← links)
- Distributed MST for constant diameter graphs (Q5919895) (← links)
- Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121) (← links)
