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

一般图中最大匹配的DFS算法

A DFS Algorithm for Maximum Matchings in General Graphs

Tony T. Lee, Bojun Lu, Hanli Chu

摘要:

在本文中,我们提出了一个深度优先搜索(DFS)算法搜索一般图的最大匹配。与花收缩算法不同,该算法将所有可能的替代交替路径存储在从花收缩的超顶点中,新提出的算法不涉及花收缩。基本的想法是在面对花朵时改变交替的路径。该算法在一个辅助栈中维护迂回信息,以最小化冗余数据结构。我们的技术的一个好处是避免花时间收缩和扩大花朵。该DFS算法可以在$O(mn)$时间内确定具有$m$边和$n$顶点的一般图的最大匹配,空间复杂度为$O(n)$。

英文摘要:

In this paper, we propose a depth-first search (DFS) algorithm for searching maximum matchings in general graphs. Unlike blossom shrinking algorithms, which store all possible alternative alternating paths in the super-vertices shrunk from blossoms, the newly proposed algorithm does not involve blossom shrinking. The basic idea is to deflect the alternating path when facing blossoms. The algorithm maintains detour information in an auxiliary stack to minimize the redundant data structures. A benefit of our technique is to avoid spending time on shrinking and expanding blossoms. This DFS algorithm can determine a maximum matching of a general graph with $m$ edges and $n$ vertices in $O(mn)$ time with space complexity $O(n)$.

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

↑