A note on the P-time algorithms for solving the maximum independent set problem
Kajand(2009)
摘要
In this article, the problem of finding maximum (weight) independent set (M(W)IS) is investigated. It is known that this problem belongs to the class of NP-hard problems. Although, there are polynomial time (P-time) algorithms to solve the M(W)IS problem for some special classes of graphs. Here, we propose a general scheme which extends all of classes that the M(W)IS problem is solvable for them in P-time. This general scheme, based on any P-time algorithm for a class of graphs C, generates a new P-time algorithm to solve the M(W)IS problem for graphs in an extension of the class C. Moreover, this new algorithm is robust.
更多查看译文
关键词
computational complexity,graph theory,set theory,NP-hard problem,P-time algorithm,graph theory,maximum independent set problem,polynomial time algorithm,Exact optimization algorithm,Maximum independent set problem,Maximum weight independent set problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要