arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.03582cs.DSmath.CO
收藏

MV匹配算法的一个证明

A Proof of the MV Matching Algorithm

Vijay V. Vazirani

摘要:

Micali-Vazirani(MV)算法的最大基数匹配的一般图,这是在1980年出版的\cite{MV},仍然是最有效的已知算法的问题。本文首次给出了该算法的完整正确的证明。我们证明的核心是一些纯粹的图论事实,捕捉最小长度交替路径的性质;这些可能是独立的兴趣。试图使算法更容易理解。

英文摘要:

The Micali-Vazirani (MV) algorithm for maximum cardinality matching in general graphs, which was published in 1980 \cite{MV}, remains to this day the most efficient known algorithm for the problem. This paper gives the first complete and correct proof of this algorithm. Central to our proof are some purely graph-theoretic facts, capturing properties of minimum length alternating paths; these may be of independent interest. An attempt is made to render the algorithm easier to comprehend.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑