%0 Journal Article %1 journals/tpds/AzadBP17 %A Azad, Ariful %A Buluç, Aydin %A Pothen, Alex %D 2017 %J IEEE Trans. Parallel Distributed Syst. %K dblp %N 1 %P 44-59 %T Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting. %U http://dblp.uni-trier.de/db/journals/tpds/tpds28.html#AzadBP17 %V 28

@article{journals/tpds/AzadBP17, added-at = {2020-10-02T00:00:00.000+0200}, author = {Azad, Ariful and Buluç, Aydin and Pothen, Alex}, biburl = {https://www.bibsonomy.org/bibtex/20d6ab007c64db2bfe6fb67ff2a5a05e9/dblp}, ee = {https://www.wikidata.org/entity/Q56740032}, interhash = {716e6a6625382602c7841c4740beae45}, intrahash = {0d6ab007c64db2bfe6fb67ff2a5a05e9}, journal = {IEEE Trans. Parallel Distributed Syst.}, keywords = {dblp}, number = 1, pages = {44-59}, timestamp = {2020-10-03T11:40:03.000+0200}, title = {Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting.}, url = {http://dblp.uni-trier.de/db/journals/tpds/tpds28.html#AzadBP17}, volume = 28, year = 2017 }