An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs
From MaRDI portal
Publication:1091829
DOI10.1016/0020-0190(87)90193-1zbMath0623.68065MaRDI QIDQ1091829
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(87)90193-1
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
An adjustable linear time parallel algorithm for maximum weight bipartite matching, Finding maximum matching for bipartite graphs in parallel
Cites Work