Pages that link to "Item:Q2706118"
From MaRDI portal
The following pages link to A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction (Q2706118):
Displaying 41 items.
- Tight bounds for distributed minimum-weight spanning tree verification (Q372968) (← links)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- A fast minimum spanning tree algorithm based on \(K\)-means (Q527132) (← links)
- On the complexity of distributed stable matching with small messages (Q660987) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- On efficient distributed construction of near optimal routing schemes (Q1741966) (← links)
- Sublinear fully distributed partition with applications (Q1959378) (← links)
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Compact distributed certification of planar graphs (Q2037111) (← links)
- Local certification of graphs with bounded genus (Q2104916) (← links)
- Approximate minimum directed spanning trees under congestion (Q2117742) (← links)
- Latency, capacity, and distributed minimum spanning trees (Q2119398) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- Fast protocols for leader election and spanning tree construction in a distributed network (Q2285076) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- Local algorithms for sparse spanning graphs (Q2300722) (← links)
- Distributed communication complexity of spanning tree construction (Q2355664) (← links)
- Distributed distance computation and routing with small messages (Q2422769) (← 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)
- Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
- Sparsifying Congested Cliques and Core-Periphery Networks (Q2835033) (← links)
- Constructing near spanning trees with few local inspections (Q2977565) (← links)
- Distributed Broadcast Revisited: Towards Universal Optimality (Q3449512) (← links)
- Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (Q3580979) (← links)
- A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees (Q4973061) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree (Q5012805) (← links)
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- From sequential layers to distributed processes (Q5348853) (← links)
- Randomized Lower Bound for Distributed Spanning-Tree Verification (Q5496155) (← links)
- Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds (Q5700572) (← links)
- (Q5743466) (← links)
- Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)
- Distributed MST for constant diameter graphs (Q5919895) (← links)
- A distributed algorithm for directed minimum-weight spanning tree (Q6487532) (← links)
