The following pages link to Algorithms – ESA 2004 (Q5464584):
Displaying 16 items.
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- Distributed algorithms for weighted problems in sparse graphs (Q866546) (← links)
- An efficient distributed algorithm for maximum matching in general graphs (Q911306) (← links)
- Distributed algorithm for approximating the maximum matching (Q1887042) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
- Approximation algorithms for Max Morse matching (Q2362103) (← links)
- Fast distributed almost stable matchings (Q2796247) (← links)
- A Local Computation Approximation Scheme to Maximum Matching (Q2851862) (← links)
- Communication complexity of approximate matching in distributed graphs (Q2955016) (← links)
- Distributed Algorithm for Better Approximation of the Maximum Matching (Q3082932) (← links)
- Maintaining bipartite matchings in the presence of failures (Q3141219) (← links)
- Improved Distributed Approximate Matching (Q3177747) (← links)
- (Q4250185) (← links)
- Distributed maximum matching verification in CONGEST (Q6535036) (← links)
- Distributed approximation for \(f\)-matching (Q6614001) (← links)