A matrix-algebraic formulation of distributed-memory maximal cardinality matching algorithms in bipartite graphs

We describe parallel algorithms for computing maximal cardinality matching in a bipartite graph on distributed-memory systems. Unlike traditional algorithms that match one vertex at a time, our algorithms process many unmatched vertices simultaneously using a matrix-algebraic formulation of maximal...

Full description

Bibliographic Details

Published in:	Parallel computing Vol. 58; no. C; pp. 117 - 130
Main Authors:	Azad, Ariful, Buluç, Aydın
Format:	Journal Article
Language:	English
Published:	United States Elsevier B.V 01.10.2016 Elsevier
Subjects:	bipartite graph cardinality matching MATHEMATICS AND COMPUTING matrix-algebra parallel algorithm cardinality matching matrix-algebra bipartite graph parallel algorithm
ISSN:	0167-8191, 1872-7336
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!