skip to main content

Title: Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting
Authors:
; ;
Award ID(s):
1637534
Publication Date:
NSF-PAR ID:
10039353
Journal Name:
IEEE Transactions on Parallel and Distributed Systems
Volume:
28
Issue:
1
Page Range or eLocation-ID:
44 to 59
ISSN:
1045-9219
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found