A distributed blossom algorithm for minimum-weight perfect matching
Distributed, Parallel, and Cluster Computing
2022-10-27 v1
Abstract
We describe a distributed, asynchronous variant of Edmonds's exact algorithm for producing perfect matchings of minimum weight. The development of this algorithm is driven by an application to online error correction in quantum computing, first envisioned by Fowler; we analyze the performance of our algorithm as applied to this domain in a sequel.
Cite
@article{arxiv.2210.14277,
title = {A distributed blossom algorithm for minimum-weight perfect matching},
author = {Eric C. Peterson and Peter J. Karalekas},
journal= {arXiv preprint arXiv:2210.14277},
year = {2022}
}