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...

Celý popis

Podrobná bibliografia

Vydané v:	Parallel computing Ročník 58; číslo C; s. 117 - 130
Hlavní autori:	Azad, Ariful, Buluç, Aydın
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States Elsevier B.V 01.10.2016 Elsevier
Predmet:	bipartite graph cardinality matching MATHEMATICS AND COMPUTING matrix-algebra parallel algorithm cardinality matching matrix-algebra bipartite graph parallel algorithm
ISSN:	0167-8191, 1872-7336
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!