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
- Developers:
-
Ferdous, S M [1] ; Khan, Arif [2]
- Pacific Northwest National Lab
- Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
- Release Date:
- 2022-11-21
- Project Type:
- Open Source, Publicly Available Repository
- Software Type:
- Scientific
- Licenses:
-
BSD 2-clause "Simplified" License
- Sponsoring Org.:
-
USDOEPrimary Award/Contract Number:AC05-76RL01830
- Code ID:
- 97102
- Site Accession Number:
- Battelle IPID 32552-E
- Research Org.:
- Pacific Northwest National Laboratory (PNNL), Richland, WA (United States)
- Country of Origin:
- United States
Citation Formats
Ferdous, S M, and Khan, Arif.
ECP-ExaGraph/Submodular-b-matching.
Computer Software.
https://github.com/ECP-ExaGraph/Submodular-b-matching.
USDOE.
21 Nov. 2022.
Web.
doi:10.11578/dc.20221121.2.
Ferdous, S M, & Khan, Arif.
(2022, November 21).
ECP-ExaGraph/Submodular-b-matching.
[Computer software].
https://github.com/ECP-ExaGraph/Submodular-b-matching.
https://doi.org/10.11578/dc.20221121.2.
Ferdous, S M, and Khan, Arif.
"ECP-ExaGraph/Submodular-b-matching." Computer software.
November 21, 2022.
https://github.com/ECP-ExaGraph/Submodular-b-matching.
https://doi.org/10.11578/dc.20221121.2.
@misc{
doecode_97102,
title = {ECP-ExaGraph/Submodular-b-matching},
author = {Ferdous, S M and Khan, Arif},
abstractNote = {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},
doi = {10.11578/dc.20221121.2},
url = {https://doi.org/10.11578/dc.20221121.2},
howpublished = {[Computer Software] \url{https://doi.org/10.11578/dc.20221121.2}},
year = {2022},
month = {nov}
}