DOE OSTI · code-21532
Parallel Maximum Cardinality Matchings via Tree-Grafting
Abstract
This software implements a new algorithm and its shared-memory parallelization for computing maximum cardinality matchings in bipartite graphs. The algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms.
Keep this discovery
Explore connections, maps & timelines
Buluc, Aydin, Azad, Md Ariful. 2016-02-26. Parallel Maximum Cardinality Matchings via Tree-Grafting. https://doi.org/10.11578/dc.20181217.1
Cite the original work for its findings. Save a collection to share your selection of sources.