An adjustable linear time parallel algorithm for maximum weight bipartite matching

DOI10.1016/J.IPL.2005.10.013zbMath1184.68615OpenAlexW2151412766MaRDI QIDQ1045931

David Kaeli, Morteza Fayyazi, Waleed M. Meleis

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.10.013

zbMATH Keywords

parallel algorithmsgraph algorithmsbipartite matching

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs
• Parallel Matrix and Graph Algorithms

This page was built for publication: An adjustable linear time parallel algorithm for maximum weight bipartite matching