The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1986 vol.35)
pp: 847-851
null Tang Jian , Department of Computer Science, Pennsylvania State University
ABSTRACT
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 [7]. A technique to further accelerate this algorithm is also described.
INDEX TERMS
NP-completeness, Case analysis, deterministic upper bound, maximum independent set
CITATION
null Tang Jian, "An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem", IEEE Transactions on Computers, vol.35, no. 9, pp. 847-851, September 1986, doi:10.1109/TC.1986.1676847
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool