Distributed-Memory Algorithms for Maximal Cardinality Matching Using Matrix Algebra

We design and implement distributed-memory parallel algorithms for computing maximal cardinality matching in a bipartite graph. Relying on matrix algebra building blocks, our algorithms expose a higher degree of parallelism on distributed-memory platforms than existing graph-based algorithms. In con...

Full description

Bibliographic Details

Published in:	Proceedings / IEEE International Conference on Cluster Computing pp. 398 - 407
Main Authors:	Azad, Ariful, Buluc, Aydin
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.09.2015
Subjects:	Algorithm design and analysis Approximation algorithms Bipartite graph cardinality matching Heuristic algorithms matching Matrices matrix algebra maximal matching Partitioning algorithms Sparse matrices
ISSN:	1552-5244
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!