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.
No takes yet. Share an insight, caveat, or question.
Jian Tang (1986) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: