The following pages link to Distributed approximate matching (Q5401409):
Displaying 7 items.
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- Theoretical underpinnings for maximal clique enumeration on perturbed graphs (Q974747) (← links)
- Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists (Q1736596) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
- Dynamic Approximate Vertex Cover and Maximum Matching (Q4933386) (← links)
- Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
