Title :
An O(20.304n) Algorithm for Solving Maximum Independent Set Problem
Author_Institution :
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.
Keywords :
Case analysis; NP-completeness; deterministic upper bound; maximum independent set; Acceleration; Algorithm design and analysis; Computer science; NP-complete problem; Polynomials; Upper bound; Case analysis; NP-completeness; deterministic upper bound; maximum independent set;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1986.1676847
