Login / Signup
A matrix-algebraic formulation of distributed-memory maximal cardinality matching algorithms in bipartite graphs.
Ariful Azad
Aydin Buluç
Published in:
Parallel Comput. (2016)
Keyphrases
</>
bipartite graph
matrix multiplication
maximum cardinality
distributed memory
linear algebra
maximum matching
learning algorithm
maximum weight
parallel implementation
computational complexity
dynamic programming
state space