"GPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs."

Mehmet Deveci et al. (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-642-40047-6_84

access: closed

type: Conference or Workshop Paper

metadata version: 2019-12-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/europar/DeveciKUC13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/europar/DeveciKUC13
Mehmet Deveci, Kamer Kaya, Bora Uçar, Ümit V. Çatalyürek:
GPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs. Euro-Par 2013: 850-861

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.