112
Views
25
CrossRef citations to date
0
Altmetric
Original Articles

An algorithm for finding a maximum weighted independent set in an arbitrary graph

&
Pages 163-175 | Received 13 Aug 1990, Published online: 08 May 2007
 

Abstract

We propose and implement an exact algorithm for the maximum weighted independent set problem based on an unconstrained quadratic 0–1 formulation and branch and bound techniques. The use of a non-greedy branch and bound method using depth first search is presented and justified along with various heuristics to improve performance. We also present computational results using randomly generated graphs with up to 500 vertices.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.