Shared-Memory Parallel Edmonds Blossom Algorithm for Maximum Cardinality Matching in General Graphs.
Gregory SchwingDaniel GrosuLoren SchwiebertPublished in: IPDPS (Workshops) (2024)
Keyphrases
- maximum cardinality
- shared memory
- bipartite graph
- matching algorithm
- parallel computation
- minimum weight
- parallel implementation
- np hard
- parallel computing
- optimal solution
- parallel processing
- parallel architecture
- endpoints
- dynamic programming
- objective function
- message passing
- graph structure
- graph theory
- undirected graph
- similarity measure
- knapsack problem
- ant colony optimization
- random walk