PARALLEL APPROXIMATE MATCHING

DOI10.1080/10637199408915410zbMath1049.68930OpenAlexW2119340899MaRDI QIDQ4819985

Thomas H. Spencer

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199408915410

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items

Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations, Implicit computation of maximum bipartite matchings by sublinear functional operations

Cites Work

• Matrix multiplication via arithmetic progressions
• An improved parallel algorithm for maximal matching
• Matching is as easy as matrix inversion
• Constructing a perfect matching is in random NC
• TWO THEOREMS IN GRAPH THEORY
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs