Improved deterministic distributed matching via rounding
From MaRDI portal
Publication:6487488
Recommendations
Cited in
(15)- Best of two local models: centralized local and distributed local algorithms
- Distributed approximation for \(f\)-matching
- Distributed approximation of maximum independent set and maximum matching
- Distributed local approximation algorithms for maximum matching in graphs and hypergraphs
- Distributed computing in the asynchronous LOCAL model
- Round compression for parallel matching algorithms
- Round compression for parallel matching algorithms
- A time hierarchy theorem for the LOCAL model
- Distributed maximum matching verification in CONGEST
- The Match-Maker: Constant-Space Distributed Majority via Random Walks
- Improved Distributed Approximate Matching
- Distributed approximate maximum matching in the CONGEST model
- Improved deterministic distributed matching via rounding
- An exponential separation between randomized and deterministic complexity in the LOCAL model
- Network Decomposition and Distributed Derandomization (Invited Paper)
This page was built for publication: Improved deterministic distributed matching via rounding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487488)