ECP-ExaGraph/Submodular-b-matching
- Pacific Northwest National Lab
- Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
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
- Short Name / Acronym:
- Submodular-b-matching
- Site Accession Number:
- Battelle IPID 32552-E
- Software Type:
- Scientific
- License(s):
- BSD 2-clause "Simplified" License
- Research Organization:
- Pacific Northwest National Laboratory (PNNL), Richland, WA (United States)
- Sponsoring Organization:
- USDOEPrimary Award/Contract Number:AC05-76RL01830
- DOE Contract Number:
- AC05-76RL01830
- Code ID:
- 97102
- OSTI ID:
- code-97102
- Country of Origin:
- United States
Similar Records
Efficient Approximation Algorithms for Weighted $b$-Matching
Efficient Approximation Algorithms for Weighted $b$-Matching
Journal Article
·
Thu Dec 31 23:00:00 EST 2015
· SIAM Journal on Scientific Computing
·
OSTI ID:1337238
Efficient Approximation Algorithms for Weighted $b$-Matching
Journal Article
·
Thu Dec 31 23:00:00 EST 2015
· SIAM Journal on Scientific Computing
·
OSTI ID:1418504