A Parallel Tree Grafting Algorithm for Maximum Cardinality Matching in Bipartite Graphs

Ariful Azad, Aydin Buluç, Alex Pothen. A Parallel Tree Grafting Algorithm for Maximum Cardinality Matching in Bipartite Graphs. In 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, Hyderabad, India, May 25-29, 2015. pages 1075-1084, IEEE Computer Society, 2015. [doi]

@inproceedings{AzadBP15,
  title = {A Parallel Tree Grafting Algorithm for Maximum Cardinality Matching in Bipartite Graphs},
  author = {Ariful Azad and Aydin Buluç and Alex Pothen},
  year = {2015},
  doi = {10.1109/IPDPS.2015.68},
  url = {http://dx.doi.org/10.1109/IPDPS.2015.68},
  researchr = {https://researchr.org/publication/AzadBP15},
  cites = {0},
  citedby = {0},
  pages = {1075-1084},
  booktitle = {2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, Hyderabad, India, May 25-29, 2015},
  publisher = {IEEE Computer Society},
  isbn = {978-1-4799-8649-1},
}