论文信息 - Finding a Maximum Independent Set - 字舞流文

Finding a Maximum Independent Set

We present an algorithm which finds a maximum independent set in an n-vertex graph in 0($2^{n/3}$) time. The algorithm can thus handle graphs roughly three times as large as could be analyzed using a naive algorithm.

Robert E. Tarjan | Anthony E. Trojanowski | R. Tarjan

[1] Leslie E. Trotter,et al. Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[2] Jack Minker,et al. An Analysis of Some Graph Theoretical Cluster Techniques , 1970, JACM.

[3] Egon Balas,et al. Finding a Minimum Node Cover in an Arbitrary Graph. , 1973 .

[4] C. Bron,et al. Algorithm 457: finding all cliques of an undirected graph , 1973 .

[5] Ellis Horowitz,et al. Computing Partitions with Applications to the Knapsack Problem , 1974, JACM.

[6] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[7] R. Tarjan. Finding a Maximum Clique. , 1972 .

[8] Derek G. Corneil,et al. Corrections to Bierstone's Algorithm for Generating Cliques , 1972, J. ACM.