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