"Shared-Memory Parallel Edmonds Blossom Algorithm for Maximum Cardinality ..."

Gregory Schwing, Daniel Grosu, Loren Schwiebert (2024)

> Home

Details and statistics

DOI: 10.1109/IPDPSW63119.2024.00107

access: closed

type: Conference or Workshop Paper

metadata version: 2024-08-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ipps/SchwingGS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipps/SchwingGS24
Gregory Schwing, Daniel Grosu, Loren Schwiebert:
Shared-Memory Parallel Edmonds Blossom Algorithm for Maximum Cardinality Matching in General Graphs. IPDPS (Workshops) 2024: 530-539

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.