无偶洞图的快速识别算法
A Faster Algorithm to Recognize Even-Hole-Free Graphs
摘要:
我们研究了确定$n$ -节点图$G$是否有偶洞的问题,即,由偶数个节点组成的诱导简单循环。Conforti、Cornuéjols、Kapoor和Vušković给出了这个问题的第一个多项式时间算法,它在$O(n^{40})$时间内运行。后来,Chudnovsky、Kawarabayashi和Seymour将运行时间减少到$O(n^{31})$。由于da Silva和Vušković的研究,该问题的最佳已知算法在$O(n^{19})$时间内运行。本文在$O(n^{11})$时间内解决了这一问题。此外,如果$G$有偶数洞,我们的算法也输出一个偶数洞的$G$在$O(n^{11})$时间。
英文摘要:
We study the problem of determining whether an $n$-node graph $G$ has an even hole, i.e., an induced simple cycle consisting of an even number of nodes. Conforti, Cornuéjols, Kapoor, and Vušković gave the first polynomial-time algorithm for the problem, which runs in $O(n^{40})$ time. Later, Chudnovsky, Kawarabayashi, and Seymour reduced the running time to $O(n^{31})$. The best previously known algorithm for the problem, due to da Silva and Vušković, runs in $O(n^{19})$ time. In this paper, we solve the problem in $O(n^{11})$ time. Moreover, if $G$ has even holes, our algorithm also outputs an even hole of $G$ in $O(n^{11})$ time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。