Pages that link to "Item:Q5090895"
From MaRDI portal
The following pages link to Distributed Approximate Maximum Matching in the CONGEST Model. (Q5090895):
Displayed 7 items.
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs (Q5115699) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)
- Minimum cost flow in the CONGEST model (Q6148076) (← 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)
- Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model (Q6202225) (← links)
- Optimal Message-Passing with Noisy Beeps (Q6202266) (← links)