"Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs ..."

Ariful Azad, Aydin Buluç, Alex Pothen (2017)

> Home

Details and statistics

DOI: 10.1109/TPDS.2016.2546258

access: closed

type: Journal Article

metadata version: 2024-05-07

- view
  authority control:
- export record
  dblp key:
  - journals/tpds/AzadBP17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tpds/AzadBP17
Ariful Azad, Aydin Buluç, Alex Pothen:
Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting. IEEE Trans. Parallel Distributed Syst. 28(1): 44-59 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.