Finding a maximum independent set

[摘要] We present an algorithm which finds a maximum independent set in an n-vertex graph in 0($2^{n/3}$) time. The algorithm can thus handle graphs roughly three times as large as could be analyzed using a naive algorithm.

[学科分类] 计算机科学（综合）