An O(20.304n) Algorithm for Solving Maximum Independent Set Problem
Jian Guo Tang · IEEE Transactions on Computers · 1986
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.