Multithreaded Algorithms for Maximum Matching in Bipartite Graphs

We design, implement, and evaluate algorithms for computing a matching of maximum cardinality in a bipartite graph on multicore and massively multithreaded computers. As computers with larger numbers of slower cores dominate the commodity processor market, the design of multithreaded algorithms to s...

Full description

Bibliographic Details

Published in:	2012 IEEE 26th International Parallel and Distributed Processing Symposium pp. 860 - 872
Main Authors:	Azad, A., Halappanavar, M., Rajamanickam, S., Boman, E. G., Khan, A., Pothen, A.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.05.2012
Subjects:	Algorithm design and analysis Arrays Bipartite graph bipartite graphs Heuristic algorithms Instruction sets maximum cardinality matchings Multicore processing multithreaded algorithm parallel algorithm Parallel algorithms
ISBN:	1467309753, 9781467309752
ISSN:	1530-2075
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!