Ariful Azad, Aydin Buluç, Alex Pothen. Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting. IEEE Trans. Parallel Distrib. Syst., 28(1):44-59, 2017. [doi]
@article{AzadBP17,
title = {Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting},
author = {Ariful Azad and Aydin Buluç and Alex Pothen},
year = {2017},
doi = {10.1109/TPDS.2016.2546258},
url = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2016.2546258},
researchr = {https://researchr.org/publication/AzadBP17},
cites = {0},
citedby = {0},
journal = {IEEE Trans. Parallel Distrib. Syst.},
volume = {28},
number = {1},
pages = {44-59},
}