DOE OSTI · code-97102
ECP-ExaGraph/Submodular-b-matching
Abstract
A b-MATCHING is a subset of edges M such that at most b(v) edges in M are incident on each vertex v, where b(v) is specified. We present a distributed-memory parallel algorithm, b-SUITOR, that computes a b-MATCHING with more than half the maximum weight in a graph with weights on the edges
Keep this discovery
Explore connections, maps & timelines
Ferdous, S M, Khan, Arif. 2022-11-21. ECP-ExaGraph/Submodular-b-matching. https://doi.org/10.11578/dc.20221121.2
Cite the original work for its findings. Save a collection to share your selection of sources.