AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER∗

DOI10.1080/10637199508915505zbMATH Open1049.68909OpenAlexW4241255862MaRDI QIDQ4820104FDOQ4820104

Authors: Myungho Kim, Chang-Sung Jeong 

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/10637199508915505

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cites Work

• Maximum matching in a convex bipartite graph
• Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems
• Parallel Scheduling Algorithms

This page was built for publication: AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER∗

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