arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.07446cs.DScs.DMmath.CO
收藏

近似线性时间中的三棵树

Three-in-a-Tree in Near Linear Time

Kai-Yuan Lai, Hsueh-I Lu, Mikkel Thorup

摘要:

三中树问题是确定一个简单无向图是否包含一个导出子图,该导出子图是一棵连接三个给定顶点的树。基于在二十多页中证明的一个漂亮的特征,Chudnovsky和Seymour [Combinatorica 2010]给出了以前唯一已知的多项式时间算法,在$O(mn^2)$时间内运行,以解决$n$ -顶点$m$ -边图上的三树问题。他们的三叉树算法已经成为几种最先进的图形识别和检测算法中的关键子程序。在本文中,我们解决了三个在一棵树的问题,在$\tilde{O}(m)$的时间,导致改进的算法识别完美的图形和检测θ,金字塔,甲虫,和奇数和偶数孔。我们的结果是基于一个新的和更建设性的表征比Chudnovsky和西摩。我们的新特征比原来的更强,我们的证明意味着一个新的更简单的证明原来的特征。改进后的特征化方法在速度上获得了第一因子$n$。其余的改进是基于动态图算法。

英文摘要:

The three-in-a-tree problem is to determine if a simple undirected graph contains an induced subgraph which is a tree connecting three given vertices. Based on a beautiful characterization that is proved in more than twenty pages, Chudnovsky and Seymour [Combinatorica 2010] gave the previously only known polynomial-time algorithm, running in $O(mn^2)$ time, to solve the three-in-a-tree problem on an $n$-vertex $m$-edge graph. Their three-in-a-tree algorithm has become a critical subroutine in several state-of-the-art graph recognition and detection algorithms. In this paper we solve the three-in-a-tree problem in $\tilde{O}(m)$ time, leading to improved algorithms for recognizing perfect graphs and detecting thetas, pyramids, beetles, and odd and even holes. Our result is based on a new and more constructive characterization than that of Chudnovsky and Seymour. Our new characterization is stronger than the original, and our proof implies a new simpler proof for the original characterization. The improved characterization gains the first factor $n$ in speed. The remaining improvement is based on dynamic graph algorithms.

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

↑