论文标题
一种分布式开花算法，用于最小重量的完美匹配
A distributed blossom algorithm for minimum-weight perfect matching
论文作者
论文摘要
我们描述了Edmonds精确算法的分布式异步变体，用于产生最小重量的完美匹配。该算法的开发是由Fowler首先设想的量子计算中在线错误校正的应用程序驱动的；我们分析了续集中应用于该域的算法的性能。
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.
