Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

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]

Authors

Ariful Azad

This author has not been identified. Look up 'Ariful Azad' in Google

Aydin Buluç

This author has not been identified. Look up 'Aydin Buluç' in Google

Alex Pothen

This author has not been identified. Look up 'Alex Pothen' in Google