Pages that link to "Item:Q2784500"
From MaRDI portal
The following pages link to On the Distributed Complexity of Computing Maximal Matchings (Q2784500):
Displayed 19 items.
- Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- Distributed algorithms for random graphs (Q888436) (← links)
- A simple local 3-approximation algorithm for vertex cover (Q987844) (← links)
- Distributed approximation for maximum weight matching on bounded degree bounded integer weight graphs (Q989486) (← links)
- Linear-in-\(\varDelta \) lower bounds in the LOCAL model (Q1689747) (← links)
- Distributed algorithm for approximating the maximum matching (Q1887042) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Improved distributed degree splitting and edge coloring (Q2189174) (← links)
- Fast primal-dual distributed algorithms for scheduling and matching problems (Q2377143) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
- Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well (Q5323085) (← links)
- Distributed half-integral matching and beyond (Q6148072) (← links)
- Distributed half-integral matching and beyond (Q6199402) (← links)
- (1- <i>ϵ</i> )-Approximate Maximum Weighted Matching in poly(1/ <i>ϵ</i> , log <i>n</i> ) Time in the Distributed and Parallel Settings (Q6202220) (← links)