A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph

Daishin Nakamura, Akihisa Tamura

Research output: Contribution to journalArticle

67 Citations (Scopus)


The maximum weight/cardinality stable set problem is to find a maximum weight/cardinality stable set of a given graph. It is well known that these problems for general graphs belong to the class of NP-hard. However, for several classes of graphs, e.g., for perfect graphs and claw-free graphs and so on, these problems can be solved in polynomial time. For instance, Minty (1980), Sbihi (1980) and Lovász and Plummer (1986) have proposed polynomial time algorithm finding a maximum cardinality stable set of a claw-free graph. Moreover, it has been believed that Minty's algorithm is the unique polynomial time algorithms finding a maximum weight stable set of a claw-free graph up to date. Here we show that Minty's algorithm for the weighted version fails for some special cases, and give modifications to overcome it.

Original languageEnglish
Pages (from-to)194-204
Number of pages11
JournalJournal of the Operations Research Society of Japan
Issue number2
Publication statusPublished - 2001 Jun


ASJC Scopus subject areas

  • Decision Sciences(all)
  • Management Science and Operations Research

Cite this