Abstract
In this paper, we introduce two powerful graph reductions for the maximum weighted stable set (mwss) in general graphs. We show that these reductions allow to reduce the mwss in claw-free graphs to the mwss in a class of quasi-line graphs, that we call bipolar-free. For this latter class, we provide a new algorithmic decomposition theorem running in polynomial time. We then exploit this decomposition result and our reduction tools again to transform the problem to either a single matching problem or a longest path computation in an acyclic auxiliary graph (in this latter part we use some results of Pulleyblank and Shepherd [10]). Putting all the pieces together, the main contribution of this paper is a new polynomial time algorithm for the mwss in claw-free graphs. A rough analysis of the complexity of this algorithm gives a time bound of O(n 6), where n is the number of vertices in the graph, and which we hope can be improved by a finer analysis. Incidentally, we prove that the mwss problem can be solved efficiently for any class of graphs that admits a “suitable” decomposition into pieces where the mwss is easy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berge, C.: Two theorems in graph theory. Proc. Nat. Acad. Sci. U.S.A. 43, 842–844 (1957)
Berge, C.: Graphs and hypergraphs. Dunod, Paris (1973)
Chudnovsky, M., Seymour, P.: The structure of claw-free graphs. In: Surveys in Combinatorics 2005. London Math. Soc. Lecture Note Series, vol. 327 (2005)
Cornuéjols, G., Cunningham, W.H.: Compositions for perfect graphs. Discrete Mathematics 55, 245–254 (1985)
Fouquet, J.: A strengthening of Ben Rebea’s lemma. Journal of Combinatorial Theory 59, 35–40 (1993)
Lovász, L., Plummer, M.D.: Matching theory. North Holland, Amsterdam (1986)
Lozin, V.V., Milani\(\breve{c}\), M.: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. In: Proceedings of SODA 2006, Miami, Florida, January 22-26 (2006)
Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. Journal of Combinatorial Theory 28, 284–304 (1980)
Nakamura, D., Tamura, A.: A revision of Minty’s algorithm for finding a maximum weighted stable set of a claw-free graph. Journal of the Operations Research Society of Japan 44(2), 194–204 (2001)
Pulleyblank, W., Shepherd, F.: Formulations for the stable set polytope. In: Rinaldi, G., Wolsey, L.A. (eds.) Proceedings of IPCO 1993, Erice, Italy, April 19 - May 1 (1993)
Sbihi, N.: Algorithme de recherche d’un stable de cardinalité maximum dans un graphe sans étoile. Discrete Mathematics 29, 53–76 (1980)
Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency. In: Algorithms and Combinatorics 24, 3 volumes. Springer, Berlin (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oriolo, G., Pietropaoli, U., Stauffer, G. (2008). A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2008. Lecture Notes in Computer Science, vol 5035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68891-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-68891-4_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68886-0
Online ISBN: 978-3-540-68891-4
eBook Packages: Computer ScienceComputer Science (R0)