"Computing maximum matching in parallel on bipartite graphs: worth the effort?"

Ariful Azad et al. (2011)

> Home

Details and statistics

DOI: 10.1145/2089142.2089147

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sc/AzadHDP11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sc/AzadHDP11
Ariful Azad, Mahantesh Halappanavar, Florin Dobrian, Alex Pothen:
Computing maximum matching in parallel on bipartite graphs: worth the effort? IA3@SC 2011: 11-14

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.