通过分而治之方法计数独立集
Counting independent sets via Divide Measure and Conquer method
摘要:
本文给出了一个计算给定图中所有独立集个数的算法,该算法对次三次图适用于时间$O^*(1.1394^n)$,对一般图适用于时间$O^*(1.2369^n)$,其中$n$是实例图的顶点数,多项式空间.其结果来自于结合两个众所周知的方法“分而治之”和“测量和征服”。我们介绍了这个新概念的划分,测量和征服方法,并期望它会发现在其他问题的应用。Björklund,Husfeldt和Koivisto的图着色算法,用我们的算法作为子程序,其复杂度为$O^*(2.2369^n)$,是目前多项式空间中最快的图着色算法。
英文摘要:
In this paper we give an algorithm for counting the number of all independent sets in a given graph which works in time $O^*(1.1394^n)$ for subcubic graphs and in time $O^*(1.2369^n)$ for general graphs, where $n$ is the number of vertices in the instance graph, and polynomial space. The result comes from combining two well known methods "Divide and Conquer" and "Measure and Conquer". We introduce this new concept of Divide, Measure and Conquer method and expect it will find applications in other problems. The algorithm of Björklund, Husfeldt and Koivisto for graph colouring with our algorithm used as a subroutine has complexity $O^*(2.2369^n)$ and is currently the fastest graph colouring algorithm in polynomial space.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。