Finding maximum matching for bipartite graphs in parallel

DOI10.1016/0167-6377(94)90021-3zbMath0813.90120OpenAlexW2036940309MaRDI QIDQ1342094

Pranay Chaudhuri

Publication date: 11 January 1995

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90021-3

zbMATH Keywords

bipartite graphsparallel algorithmmaximum matching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parallel numerical computation (65Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs
• Fast parallel graph searching with applications
• Parallel computation and conflicts in memory access
• TWO THEOREMS IN GRAPH THEORY
• Parallel Matrix and Graph Algorithms
• An O(n2log n) parallel max-flow algorithm
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs