arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.14849cs.DS
收藏

一般图中Gabow的基数匹配算法:实现与实验

Gabow's Cardinality Matching Algorithm in General Graphs: Implementation and Experiments

Matin Ansaripour, Alireza Danaei, Kurt Mehlhorn

AI总结:

本文描述了基于LEDA的Gabow基数匹配算法的C++实现,通过实验表明其在最坏情况图上性能显著提升,在随机图上呈近线性表现且已开源。

摘要:

自1975年(\cite{HK75})起,人们就知道具有$n$个节点和$m$条边的二分图中的最大基数匹配可以在$O(\sqrt{n} m)$时间内计算出来。在过去十年中发现了渐近更快的算法,现在最大基数二分匹配可以在近线性时间内计算出来~\cite{NearlyLinearTimeBipartiteMatching, AlmostLinearTimeMaxFlow,AlmostLinearTimeMinCostFlow}。对于一般图,该问题似乎更难。文献~\cite{MV80,Vazirani94,Vazirani12,Vazirani20,Vazirani23,Goldberg-Karzanov,GT91,Gabow:GeneralMatching}中给出了运行时间为$O(\sqrt{n} m)$的算法。Mattingly和Ritchey~\cite{Mattingly-Ritchey}以及Huang和Stein~\cite{Huang-Stein}讨论了Micali-Vazirani算法的实现。我们描述了基于LEDA~\cite{LEDAsystem,LEDAbook}的Gabow算法~\cite{Gabow:GeneralMatching}的C++实现,并报告了运行时间实验。在最坏情况图上,渐近改进带来了显著的收益。在随机图上,相对于最坏情况运行时间为$O(n m)$的算法没有改进。其性能似乎是近线性的。该实现以开源形式提供。

英文摘要:

It is known since 1975 (\cite{HK75}) that maximum cardinality matchings in bipartite graphs with $n$ nodes and $m$ edges can be computed in time $O(\sqrt{n} m)$. Asymptotically faster algorithms were found in the last decade and maximum cardinality bipartite matchings can now be computed in near-linear time~\cite{NearlyLinearTimeBipartiteMatching, AlmostLinearTimeMaxFlow,AlmostLinearTimeMinCostFlow}. For general graphs, the problem seems harder. Algorithms with running time $O(\sqrt{n} m)$ were given in~\cite{MV80,Vazirani94,Vazirani12,Vazirani20,Vazirani23,Goldberg-Karzanov,GT91,Gabow:GeneralMatching}. Mattingly and Ritchey~\cite{Mattingly-Ritchey} and Huang and Stein~\cite{Huang-Stein} discuss implementations of the Micali-Vazirani Algorithm. We describe an implementation of Gabow's algorithm~\cite{Gabow:GeneralMatching} in C++ based on LEDA~\cite{LEDAsystem,LEDAbook} and report on running time experiments. On worst-case graphs, the asymptotic improvement pays off dramatically. On random graphs, there is no improvement with respect to algorithms that have a worst-case running time of $O(n m)$. The performance seems to be near-linear. The implementation is available open-source.

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

↑