Location of Repository

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

Provided by:
Warwick Research Archives Portal Repository

Downloaded from
http://wrap.warwick.ac.uk/3314/1/WRAP_Lozin_independent_sets.pdf

- (1984). A method for solving certain graph recognition and optimization problems, with applications to perfect graphs, in Topics on Perfect Graphs,
- (2008). A polynomial algorithm to ﬁnd an independent set of maximum weight in a fork-free graph,
- (2001). A revision of Minty’s algorithm for ﬁnding a maximum weight stable set of a claw-free graph,
- (1980). Algorithme de recherche d’un stable de cardinalit´ e maximum dans un graphe sans ´ etoile,
- (2004). Algorithmic graph theory and perfect graphs,
- (1972). Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph,
- (2008). Claw-free graphs. III—Circular interval graphs,
- (2007). Claw-free graphs.I — Orientable prismatic graphs,J .C o m -bin. Theory Ser.
- (2008). Claw-free graphs.V — Global structure,J .C o m b i n .T h e o r y Ser.
- Claw-free graphs.V I — The structure of quasi-line graphs,
- (1981). Complement reducible graphs,
- (1985). Decomposition by clique separators,
- (2003). Eﬃcient Graph Representations, Fields Inst.
- (1999). Graph Classes: A Survey,
- (2008). Independent sets of maximum weight in apple-free graphs,
- (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.
- (2007). New applications of clique separator decomposition for the maximum weight stable set problem,
- (2007). On clique separators, nearly chordal graphs, and the maximum weight stable set problem,
- (2010). On independent vertex sets in subclasses of apple-free graphs,
- (1980). On maximal independent sets of vertices in claw-free graphs,
- (1993). On the vertex packing problem,
- (1965). Paths, trees and ﬂowers,
- (2003). Robust algorithms for the stable set problem,
- (1997). Ryj´ aˇ cek, Claw-free graphs—a survey,
- (1975). Some polynomial algorithms for certain graphs and hypergraphs,
- (2000). Stability in P5- and banner-free graphs,
- (2007). The roots of the independence polynomial of a claw-free graph,
- (1989). The strong perfect graph conjecture for pan-free graphs,
- (1957). Two theorems in graph theory,

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