Location of Repository

Independent sets of maximum weight in apple-free graphs

By Andreas Brandstädt, Vadim V. Lozin and Raffaele Mosca


We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs, chordal graphs, and cographs. Our solution is based on a combination of two algorithmic techniques (modular decomposition and decomposition by clique separators) and a deep combinatorial analysis of the structure of apple-free graphs. Our algorithm is robust in the sense that it does not require the input graph G to be apple-free; the algorithm either finds an independent set of maximum weight in G or reports that G is not apple-free

Topics: QA
Publisher: Society for Industrial and Applied Mathematics
Year: 2010
OAI identifier: oai:wrap.warwick.ac.uk:3314

Suggested articles



  1. (1984). A method for solving certain graph recognition and optimization problems, with applications to perfect graphs, in Topics on Perfect Graphs, doi
  2. (2008). A polynomial algorithm to find an independent set of maximum weight in a fork-free graph, doi
  3. (2001). A revision of Minty’s algorithm for finding a maximum weight stable set of a claw-free graph,
  4. (1980). Algorithme de recherche d’un stable de cardinalit´ e maximum dans un graphe sans ´ etoile, doi
  5. (2004). Algorithmic graph theory and perfect graphs, doi
  6. (1972). Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph, doi
  7. (2008). Claw-free graphs. III—Circular interval graphs, doi
  8. (2007). Claw-free graphs.I — Orientable prismatic graphs,J .C o m -bin. Theory Ser. doi
  9. (2008). Claw-free graphs.V — Global structure,J .C o m b i n .T h e o r y Ser. doi
  10. Claw-free graphs.V I — The structure of quasi-line graphs, doi
  11. (1981). Complement reducible graphs, doi
  12. (1985). Decomposition by clique separators, doi
  13. (2003). Efficient Graph Representations, Fields Inst.
  14. (1999). Graph Classes: A Survey, doi
  15. (2008). Independent sets of maximum weight in apple-free graphs, doi
  16. (1965). Maximum matching and a polyhedron with 0,1-vertices,J .R e s .N a t .B u r .S t a n -dards Sect. doi
  17. (2007). New applications of clique separator decomposition for the maximum weight stable set problem, doi
  18. (2007). On clique separators, nearly chordal graphs, and the maximum weight stable set problem, doi
  19. (2010). On independent vertex sets in subclasses of apple-free graphs, doi
  20. (1980). On maximal independent sets of vertices in claw-free graphs, doi
  21. (1993). On the vertex packing problem, doi
  22. (1965). Paths, trees and flowers, doi
  23. (2003). Robust algorithms for the stable set problem, doi
  24. (1997). Ryj´ aˇ cek, Claw-free graphs—a survey, doi
  25. (1975). Some polynomial algorithms for certain graphs and hypergraphs,
  26. (2000). Stability in P5- and banner-free graphs, doi
  27. (2007). The roots of the independence polynomial of a claw-free graph, doi
  28. (1989). The strong perfect graph conjecture for pan-free graphs, doi
  29. (1957). Two theorems in graph theory, doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.