"Distributed-Memory Algorithms for Maximum Cardinality Matching in ..."

Ariful Azad, Aydin Buluç (2016)

> Home

Details and statistics

DOI: 10.1109/IPDPS.2016.103

access: closed

type: Conference or Workshop Paper

metadata version: 2024-05-07

- view
  authority control:
- export record
  dblp key:
  - conf/ipps/AzadB16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipps/AzadB16
Ariful Azad, Aydin Buluç:
Distributed-Memory Algorithms for Maximum Cardinality Matching in Bipartite Graphs. IPDPS 2016: 32-42

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.