PARALLEL APPROXIMATE MATCHING

DOI10.1080/10637199408915410zbMATH1049.68930OpenAlexW2119340899MaRDI QIDQ4819985FDOQ4819985

Authors 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)

Cites work

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

Cited in

(2)

• Implicit computation of maximum bipartite matchings by sublinear functional operations
• Implicit computation of maximum bipartite matchings by sublinear functional operations

This page was built for publication: PARALLEL APPROXIMATE MATCHING

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819985)