Distributed Weighted Matching
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Constant-time distributed dominating set approximationPublished by Association for Computing Machinery (ACM) ,2003
- On the Distributed Complexity of Computing Maximal MatchingsSIAM Journal on Discrete Mathematics, 2001
- Parallel approximation algorithms for maximum weighted matching in general graphsInformation Processing Letters, 2000
- Distributed Computing: A Locality-Sensitive ApproachPublished by Society for Industrial & Applied Mathematics (SIAM) ,2000
- A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex CoversJournal of Algorithms, 1994
- Locality in Distributed Graph AlgorithmsSIAM Journal on Computing, 1992
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986
- A fast and simple randomized parallel algorithm for maximal matchingInformation Processing Letters, 1986
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965