Issue No. 09 - September (1986 vol. 35)
null Tang Jian , Department of Computer Science, Pennsylvania State University
A faster algorithm for finding a maximum independent set in a graph is presented. The algorithm is an improved version of the one by Tarjan and Trojanowski . A technique to further accelerate this algorithm is also described.
NP-completeness, Case analysis, deterministic upper bound, maximum independent set
n. Tang Jian, "An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem," in IEEE Transactions on Computers, vol. 35, no. , pp. 847-851, 1986.