On the tractability of the maximum independent set problem

03/26/2019 ∙ by R. Dharmarajan, et al. ∙ 0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.