Pages that link to "Item:Q3082932"
From MaRDI portal
The following pages link to Distributed Algorithm for Better Approximation of the Maximum Matching (Q3082932):
Displaying 12 items.
- On the distributed complexity of the semi-matching problem (Q736606) (← links)
- Distributed algorithms for weighted problems in sparse graphs (Q866546) (← links)
- Distributed algorithm for extrema-finding in circular configuration of processors (Q1083214) (← links)
- Distributed algorithm for approximating the maximum matching (Q1887042) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Improved Distributed Approximate Matching (Q3177747) (← links)
- (Q4250185) (← links)
- Distributed Approximate Maximum Matching in the CONGEST Model. (Q5090895) (← links)
- Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs (Q5115699) (← links)
- The Match-Maker: Constant-Space Distributed Majority via Random Walks (Q5207899) (← links)
- Distributed maximum matching verification in CONGEST (Q6535036) (← links)
- Distributed approximation for \(f\)-matching (Q6614001) (← links)