Cart (Loading....) | Create Account
Close category search window
 

A note on the P-time algorithms for solving the maximum independent set problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Esfahani, N.N. ; Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan, Iran ; Mazrooei, P. ; Mahdaviani, K. ; Omoomi, B.

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.

Published in:

Data Mining and Optimization, 2009. DMO '09. 2nd Conference on

Date of Conference:

27-28 Oct. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.