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

最大独立集问题的实验算法

Experimental Algorithm for the Maximum Independent Set Problem

Anatoly D. Plotnikov

摘要:

我们开发了一个实验算法的最大独立集问题的精确求解。该算法连续地找到任意无向图中的顶点的最大独立集,使得下一个这样的集合包含比前一个更多的元素。为此目的,我们使用了一种技术,开发的福特和Fulkerson有限偏序集,特别是他们的方法划分的偏序集成最小数量的链,找到最大的反链。在求解过程中,构造了一个特殊的有向图,并对这类有向图的性质提出了一个猜想。这允许提供解决方案算法。它的理论估计的运行时间等于是$O(n^{8})$,其中$n$是图的顶点数。所提出的算法在随机图上进行了测试。通过测试验证了算法的正确性。

英文摘要:

We develop an experimental algorithm for the exact solving of the maximum independent set problem. The algorithm consecutively finds the maximal independent sets of vertices in an arbitrary undirected graph such that the next such set contains more elements than the preceding one. For this purpose, we use a technique, developed by Ford and Fulkerson for the finite partially ordered sets, in particular, their method for partition of a poset into the minimum number of chains with finding the maximum antichain. In the process of solving, a special digraph is constructed, and a conjecture is formulated concerning properties of such digraph. This allows to offer of the solution algorithm. Its theoretical estimation of running time equals to is $O(n^{8})$, where $n$ is the number of graph vertices. The offered algorithm was tested by a program on random graphs. The testing the confirms correctness of the algorithm.

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

↑