We present an algorithm which finds a maximum independent set in an n-vertex graph in O(2n/3) time. The algorithm can thus handle graphs roughly three times as large as could be analyzed using a naive algorithm.
No takes yet. Share an insight, caveat, or question.
Tarjan et al. (1977) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: