An adjustable linear time parallel algorithm for maximum weight bipartite matching

DOI10.1016/J.IPL.2005.10.013MaRDI QIDQ1045931zbMATH OpenOpenAlexFDO

Authors Morteza Fayyazi, David Kaeli, 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

graph algorithmsparallel algorithmsbipartite matching

Mathematics Subject Classification ID

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

Recommendations

• An optimal parallel algorithm for maximal matching
• Sublinear-Time Parallel Algorithms for Matching and Related Problems
• Finding maximum matching for bipartite graphs in parallel
• An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs
• An improved parallel algorithm for maximal matching

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs
• Parallel Matrix and Graph Algorithms

Cited in

(1)

• A distributed-memory algorithm for computing a heavy-weight perfect matching on bipartite graphs

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

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