On the tractability of the maximum independent set problem

03/26/2019

∙

by   R. Dharmarajan, et al.

∙

0

∙

share

The maximum independent set problem is a classical NP-complete problem in graph theory and has important practical applications in many domains. In this paper we show, in a partially non-constructive way, the existence of an exact polynomial-time algorithm for this problem. We outline the algorithm in pseudo-code style. Then we prove its exactness and efficiency by analysis.