This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
September 1986 (vol. 35 no. 9)
pp. 847-851
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 [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(20.304n) Algorithm for Solving Maximum Independent Set Problem," IEEE Transactions on Computers, vol. 35, no. 9, pp. 847-851, Sept. 1986, doi:10.1109/TC.1986.1676847
Usage of this product signifies your acceptance of the Terms of Use.