Pages that link to "Item:Q1887042"
From MaRDI portal
The following pages link to Distributed algorithm for approximating the maximum matching (Q1887042):
Displaying 14 items.
- A two-stage hardware scheduler combining greedy and optimal scheduling (Q436901) (← links)
- Why locally-fair maximal flows in client-server networks perform well (Q652641) (← links)
- On the distributed complexity of the semi-matching problem (Q736606) (← 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 extrema-finding in circular configuration of processors (Q1083214) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Fast distributed almost stable matchings (Q2796247) (← links)
- Distributed Algorithm for Better Approximation of the Maximum Matching (Q3082932) (← links)
- Improved Distributed Approximate Matching (Q3177747) (← links)
- (Q4250185) (← links)
- The Match-Maker: Constant-Space Distributed Majority via Random Walks (Q5207899) (← links)
- Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well (Q5323085) (← links)
- Algorithms – ESA 2004 (Q5464584) (← links)