scientific article; zbMATH DE number 7561282
From MaRDI portal
Publication:5090922
DOI10.4230/LIPIcs.DISC.2018.30zbMath1497.68564MaRDI QIDQ5090922
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
Latency, capacity, and distributed minimum spanning trees ⋮ Communication costs in a geometric communication network ⋮ Deterministic Fault-Tolerant Connectivity Labeling Scheme ⋮ Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model ⋮ Low-congestion shortcut and graph parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Tight bounds for distributed minimum-weight spanning tree verification
- A fast distributed approximation algorithm for minimum spanning trees
- Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication
- Near-Optimal Distributed Maximum Flow
- Toward Optimal Bounds in the Congested Clique
- Distributed Minimum Cut Approximation
- Simple, Fast and Deterministic Gossip and Rumor Spreading
- Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Distributed Computing: A Locality-Sensitive Approach
- Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut
- A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees
- A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities
- A highly asynchronous minimum spanning tree protocol
- A linear-time optimal-message distributed algorithm for minimum spanning trees
- Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set
- Distributed approximation algorithms for weighted shortest paths
- Fast distributed construction of k-dominating sets and applications
- A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
- MST in Log-Star Rounds of Congested Clique
- Distributed MST and Routing in Almost Mixing Time
- Distributed verification and hardness of distributed approximation
- Fast routing table construction using small messages
- Almost-Tight Distributed Minimum Cut Algorithms
- On the Complexity of Universal Leader Election
- Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history
This page was built for publication:
