default search action
"Shared-Memory Parallel Edmonds Blossom Algorithm for Maximum Cardinality ..."
Gregory Schwing, Daniel Grosu, Loren Schwiebert (2024)
- 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.