arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.08480cs.DScs.DM
收藏

置换图和梯形图中最大诱导匹配问题的高效算法

Efficient algorithms for maximum induced matching problem in permutation and trapezoid graphs

Viet Dung Nguyen, Ba Thai Pham, Phan Thuan Do

AI总结:

本文提出置换图和梯形图中最大诱导匹配的高效算法,利用动态规划、扫描线和不相交集合,将复杂度从$\mathcal{O}(mn)$降至$\mathcal{O}(m+n)$或线性时间。

摘要:

我们首先设计了一个基于动态规划算法并借助扫描线技术的$\mathcal{O}(n^2)$解决方案,用于在给定置换模型的置换图中寻找最大诱导匹配。在不相交集合数据结构的支持下,我们将复杂度改进为$\mathcal{O}(m + n)$。因此,我们将此结果扩展,为梯形图中的同一问题给出了$\mathcal{O}(m + n)$算法。通过将我们的算法与当前最佳的图识别算法相结合,我们可以在线性时间和$\mathcal{O}(n^2)$时间内分别解决置换图和梯形图中的MIM问题。我们的结果远优于Habib等人提出的针对这两类图的最大诱导匹配问题的最佳已知$\mathcal{O}(mn)$算法。

英文摘要:

We first design an $\mathcal{O}(n^2)$ solution for finding a maximum induced matching in permutation graphs given their permutation models, based on a dynamic programming algorithm with the aid of the sweep line technique. With the support of the disjoint-set data structure, we improve the complexity to $\mathcal{O}(m + n)$. Consequently, we extend this result to give an $\mathcal{O}(m + n)$ algorithm for the same problem in trapezoid graphs. By combining our algorithms with the current best graph identification algorithms, we can solve the MIM problem in permutation and trapezoid graphs in linear and $\mathcal{O}(n^2)$ time, respectively. Our results are far better than the best known $\mathcal{O}(mn)$ algorithm for the maximum induced matching problem in both graph classes, which was proposed by Habib et al.

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

↑