Skip to main content
SpringerLink
Log in

The Maximum Independent Set Problem and Augmenting Graphs

  • Chapter
Graph Theory and Combinatorial Optimization

Abstract

In the present paper we review the method of augmenting graphs, which is a general approach to solve the maximum independent set problem. Our objective is the employment of this approach to develop polynomial-time algorithms for the problem on special classes of graphs. We report principal results in this area and propose several new contributions to the topic.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Abbas, N. and Stewart, L.K. (2000). Biconvex graphs: ordering and algorithms. Discrete Applied Mathematics, 103:1–19.

    Article  MathSciNet  Google Scholar 

  • Alekseev, V.E. (1983) On the local restrictions effect on the complexity of finding the graph independence number. Combinatorial-Algebraic Methods in Applied Mathematics, Gorkiy University Press, Gorky, pp. 3–13, in Russian.

    Google Scholar 

  • Alekseev, V.E. (1999). A polynomial algorithm for finding largest independent sets in fork-free graphs, Diskretnyj Analiz i Issledovanie Operatsii, Seriya 1 6(4):3–19. (In Russian, translation in Discrete Applied Mathematics, 135:3–16, 2004).

    MATH  Google Scholar 

  • Alekseev, V.E. (2004). On easy and hard hereditary classes of graphs with respect to the independent set problem, Discrete Applied Mathematics, 132:17–26.

    Article  Google Scholar 

  • Alekseev, V.E. and Lozin, V.V. (2004) Augmenting graphs for independent sets. Discrete Applied Mathematics, 145:3–10.

    Article  MathSciNet  Google Scholar 

  • Barré, V. and Fouquet, J.-L. (1999). On minimal imperfect graphs without induced P 5. Discrete Applied Mathematics, 94:9–33.

    Article  MathSciNet  Google Scholar 

  • Barrow, H.G. and Burstal, R.M. (1976). Subgraph isomorphism, matching relational structures, and maximal cliques. Information Processing Letters, 4:83–84.

    Article  Google Scholar 

  • Berge, C. (1957). Two theorems in graph theory. Proceedings of the National Academy of Sciences of the United States of America, 43:842–844.

    Article  PubMed  MATH  MathSciNet  ADS  Google Scholar 

  • Boliac, R. and Lozin, V.V. (2001). An attractive class of bipartite graphs. Discussiones Mathematicae Graph Theory, 21:293–301.

    MathSciNet  Google Scholar 

  • Boliac, R. and Lozin, V.V. (2003a). Independent domination in finitely defined classes of graphs. Theoretical Computer Science, 301:271–284.

    Article  MathSciNet  Google Scholar 

  • Boliac, R. and Lozin, V.V. (2003b). An augmenting graph approach to the independent set problem in P 5-free graphs. Discrete Applied Mathematics, 131:567–575.

    Article  MathSciNet  Google Scholar 

  • Bomze, I.M., Budinich, M., Pardalos, P.M., and Pelillo, M. (1999). The maximum clique problem. In: D.-Z. Du and P.M. Pardalos (eds), Handbook of Combinatorial Optimization-Suppl. Vol. A, Kluwer Academic Publishers, pp. 1–74, Boston, MA.

    Google Scholar 

  • Boros, E. and Hammer, P.L. (2002). Pseudo-Boolean optimization. Discrete Applied Mathematics, 123:155–225.

    Article  MathSciNet  Google Scholar 

  • Cameron, K. (1989). Induced matchings. Discrete Applied Mathematics, 24:97–102.

    Article  MATH  MathSciNet  Google Scholar 

  • Denley, T. (1994). The independence number of graphs with large odd girth. Electronic Journal of Combinatorics, 1:Research Paper 9, 12 pp.

    Google Scholar 

  • De Simone, C. and Sassano, A. (1993). Stability number of bull-and chair-free graphs. Discrete Applied Mathematics, 41:121–129.

    Article  MathSciNet  Google Scholar 

  • Ebenegger, Ch., Hammer, P.L., and de Werra, D. (1984). Pseudo-Boolean functions and stability of graphs. Annals of Discrete Mathematics, 19:83–98.

    Google Scholar 

  • Edmonds, J. (1965). Path, trees, and flowers. Canadian Journal of Mathematics, 17:449–467.

    Article  MATH  MathSciNet  Google Scholar 

  • Garey, M.R., Johnson, D.S., and Stockmeyer, L. (1976). Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237–267.

    Article  MathSciNet  Google Scholar 

  • Gerber, M.U., Hertz, A., and Lozin, V.V. (2003). Augmenting Chains in Graphs Without a Skew Star. RUTCOR Research Report, Rutgers University, USA.

    Google Scholar 

  • Gerber, M.U., Hertz, A., and Lozin, V.V. (2004a). Stable sets in two subclasses of banner-free graphs. Discrete Applied Mathematics, 132:121–136.

    Article  MathSciNet  Google Scholar 

  • Gerber, M.U., Hertz, A., and Schindl, D. (2004b). P 5-free augmenting graphs and the maximum stable set problem. Discrete Applied Mathematics, 132:109–119.

    Article  MathSciNet  Google Scholar 

  • Grötschel, M., Lovász, L., and Schrijver, A. (1984). Polynomial algorithms for perfect graphs. Annals of Discrete Mathematics, 21:325–356.

    Google Scholar 

  • Halldórsson, M.M. (1995). Approximating discrete collections via local improvements. Proceedings of the Sixth SAIM-ACM Symposium on Discrete Algorithms (San Francisco, CA, 1995), pp. 160–169.

    Google Scholar 

  • Halldórsson, M.M. (2000). Approximation of weighted independent sets and hereditary subset problems. Journal of Graph Algorithms and Ap plications, 4:1–16.

    MATH  Google Scholar 

  • Hammer, P.L., Peled, U.N., and Sun, X. (1990). Difference graphs. Discrete Applied Mathematics, 28:35–44.

    Article  MathSciNet  Google Scholar 

  • HÃ¥stad, J. (1999). Clique is hard to approximate within n 1−ε. Acta Mathematica, 182:105–142.

    Article  MATH  MathSciNet  Google Scholar 

  • Hertz, A., Lozin, V.V., and Schindl, D. (2003). On finding augmenting chains in extensions of claw-free graphs. Information Processing Letters 86:311–316.

    Article  MathSciNet  Google Scholar 

  • Jagota, A., Narasimhan, G., and Soltes, L. (2001). A generalization of maximal independent sets. Discrete Applied Mathematics, 109:223–235.

    Article  MathSciNet  Google Scholar 

  • Johnson, D.S., Yannakakis, M., and Papadimitriou, C.H. (1988). On generating all maximal independent sets. Information Processing Letters, 27:119–123.

    Article  MathSciNet  Google Scholar 

  • Lawler, E.L., Lenstra, J.K., and Rinnooy Kan, A.H.G. (1980). Generating all maximal independent sets: NP-hardness and polynomnial-time algorithms. SIAM Journal on Computing, 9:558–565.

    Article  MathSciNet  Google Scholar 

  • Lozin, V.V. (2000a). Stability in P 5-and Banner-free graphs. European J. Operational Research, 125:292–297, 2000a.

    Article  MATH  MathSciNet  Google Scholar 

  • Lozin, V.V. (2000b). E-free bipartite graphs. Discrete Analysis and Operations Research, Ser.1, 7:49–66, in Russian.

    MATH  MathSciNet  Google Scholar 

  • Lozin, V.V. (2002a). On maximum induced matchings in bipartite graphs. Information Processing Letters, 81:7–11.

    Article  MATH  MathSciNet  Google Scholar 

  • Lozin, V.V. (2002b). Bipartite graphs without a skew star. Discrete Mathematics, 257:83–100.

    Article  MATH  MathSciNet  Google Scholar 

  • Lozin, V.V. and Rautenbach, D. (2003). Some results on graphs without long induced paths. Information Processing Letters, 86:167–171.

    Article  MathSciNet  Google Scholar 

  • Minty, G.J. (1980). On maximal independent sets of vertices in claw-free graphs. Journal of Combinatorial Theory, Ser.B, 28:284–304.

    Article  MATH  MathSciNet  Google Scholar 

  • Mosca, R. (1997). Polynomial algorithms for the maximum independent set problem on particular classes of P 5-free graphs. Information Processing Letters, 61:137–144.

    Article  MathSciNet  ADS  Google Scholar 

  • Mosca, R. (1999). Independent sets in certain P 6-free graphs. Discrete Applied Mathematics, 92:177–191.

    Article  MATH  MathSciNet  Google Scholar 

  • Mtiller, H. (1990). Alternating cycle-free matchings. Order, 7:11–21.

    Article  MathSciNet  Google Scholar 

  • Olariu, S. (1989). The strong perfect graph conjecture for pan-free graphs. Journal of Combinatorial Theory, Ser. B, 47:187–191.

    Article  MATH  MathSciNet  Google Scholar 

  • Pelillo, M., Siddiqi, K., and Zucker, S.W. (1999). Matching hierarchical structures using association graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21:1105–1120.

    Article  Google Scholar 

  • Plaisted, D.A. and Zaks, S. (1980). An NP-complete matching problem. Discrete Applied Mathematics, 2:65–72.

    Article  MathSciNet  Google Scholar 

  • Sbihi, N. (1980). Algorithme de recherche d'un independent de cardinalité maximum dans un graphe sans étoile. Discrete Mathematics, 29:53–76.

    Article  MATH  MathSciNet  Google Scholar 

  • Spinrad, J., Brandstädt, A., and Stewart, L. (1987). Bipartite permutation graphs. Discrete Applied Mathematics, 18:279–292.

    Article  MathSciNet  Google Scholar 

  • Stockmeyer, L. and Vazirani, V.V. (1982). NP-completeness of some generalizations of the maximum matching problems. Information Processing Letters, 15:14–19.

    Article  MathSciNet  Google Scholar 

  • Tsukiyama, S., Ide, M., Ariyoshi, H., and Shirakawa, I. (1977). A new algorithm for generating all maximal independent sets. SIAM Journal on Computing, 6:505–516.

    Article  MathSciNet  Google Scholar 

  • Yannakakis, M. (1981). Node-deletion problems on bipartite graphs. SIAM Journal on Computing, 10:310–327.

    Article  MATH  MathSciNet  Google Scholar 

  • Yannakakis, M. and Gavril, F. (1980). Edge dominating sets in graphs. SIAM Journal on Applied Mathematics, 38:364–372, 1980.

    Article  MathSciNet  Google Scholar 

Download references

Authors
  1. Alain Hertz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vadim V. Lozin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. McGill University & GERAD, Montréal, Canada

    David Avis

  2. École Polytechnique de Montréal & GERAD, Montréal, Canada

    Alain Hertz

  3. Université du Québec a Montréal and GERAD, Montréal, Canada

    Odile Marcotte

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Hertz, A., Lozin, V.V. (2005). The Maximum Independent Set Problem and Augmenting Graphs. In: Avis, D., Hertz, A., Marcotte, O. (eds) Graph Theory and Combinatorial Optimization. Springer, Boston, MA. https://doi.org/10.1007/0-387-25592-3_4

Download citation

Publish with us

Policies and ethics

Search

Navigation