Skip to main content
SpringerLink
Log in

The Maximum Independent Set Problem in Planar Graphs

  • Conference paper
Mathematical Foundations of Computer Science 2008 (MFCS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5162))

Abstract

We study the computational complexity of finding a maximum independent set of vertices in a planar graph. In general, this problem is known to be NP-hard. However, under certain restrictions it becomes polynomial-time solvable. We identify a graph parameter to which the complexity of the problem is sensible and produce a number of both negative (intractable) and positive (solvable in polynomial time) results, generalizing several known facts.

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 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

  1. Alekseev, V.E.: The Effect of Local Constraints on the Complexity of Determination of the Graph Independence Number. In: Combinatorial-algebraic methods in applied mathematics, pp. 3–13. Gorkiy University Press, Gorky (1982) (in Russian)

    Google Scholar 

  2. Alekseev, V.E.: On the Number of Maximal Independent Sets in Graphs from Hereditary Classes. In: Combinatorial-algebraic methods in discrete optimization, pp. 5–8. University of Nizhny Novgorod (1991) (in Russian)

    Google Scholar 

  3. Alekseev, V.E.: A Polynomial Algorithm for Finding the Largest Independent Sets in Fork-free Graphs. Discrete Appl. Math. 135, 3–16 (2004)

    Article  MathSciNet  Google Scholar 

  4. Arnborg, S., Proskurowski, A.: Linear Time Algorithms for NP-hard Problems Restricted to Partial k-trees. Discrete Appl. Math. 23, 11–24 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bodlaender, H.: A Partial k-Arboretum of Graphs with Bounded Treewidth. Theor. Comput. Sci. 209, 1–45 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. De Simone, C.: On the Vertex Packing Problem. Graphs Combinator. 9, 19–30 (1993)

    Article  MATH  Google Scholar 

  7. Demaine, E.D., Hajiaghayi, M.T.: Diameter and Treewidth in Minor-Closed Graph Families, Revisited. Algorithmica 40, 211–215 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Farber, M., Hujter, M., Tuza, Zs.: An Upper Bound on the Number of Cliques in a Graph. Networks 23, 207–210 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  9. Garey, M.G., Johnson, D.S.: The Rectilinear Steiner Tree Problem is NP-Complete. SIAM J. Appl. Math. 32, 826–834 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  10. Kamiński, M., Lozin, V.V., Milanič, M.: Recent Developments on Graphs of Bounded Clique-Width. Discrete Appl. Math. (accepted), http://rutcor.rutgers.edu/pub/rrr/reports2007/6_2007.pdf

  11. Lozin, V., Milanič, M.: A Polynomial Algorithm to Find an Independent Set of Maximum Weight in a Fork-free Graph. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms SODA 2006, pp. 26–30 (2006)

    Google Scholar 

  12. Lozin, V., Milanič, M.: Maximum Independent Sets in Graphs of Low Degree. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms SODA 2007, pp. 874–880 (2007)

    Google Scholar 

  13. Lozin, V.V., Mosca, R.: Independent Sets in Extensions of 2K 2-Free Graphs. Discrete Appl. Math. 146, 74–80 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  14. Minty, G.J.: On Maximal Independent Sets of Vertices in Claw-free Graphs. J. Comb. Theory B 28, 284–304 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  15. Murphy, O.J.: Computing Independent Sets in Graphs With Large Girth. Discrete Appl. Math. 35, 167–170 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  16. Robertson, N., Seymour, P.D.: Graph Minors. V. Excluding a Planar Graph. J. Comb. Theory B 41, 92–114 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  17. Robertson, N., Sanders, D., Seymour, P., Thomas, R.: The Four-Colour Theorem. J. Comb. Theory B 70, 2–44 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  18. Sbihi, N.: Algorithme de Recherche d’un Stable de Cardinalité Maximum dans un Graphe Sans Étoile. Discrete Math. 29, 53–76 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  19. Tarjan, R.E.: Decomposition by Clique Separators. Discrete Math. 55, 221–232 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  20. Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A New Algorithm for Generating All the Maximal Independent Sets. SIAM J. Computing 6, 505–517 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  21. Whitesides, S.H.: An Algorithm for Finding Clique Cut-sets. Inform. Process. Lett. 12, 31–32 (1981)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computational Mathematics, Nizhny Novgorod University, Russia

    Vladimir E. Alekseev & Dmitriy Malyshev

  2. DIMAP and Mathematics Institute, University of Warwick, Coventry, UK

    Vadim Lozin

  3. AG Genominformatik, Faculty of Technology, Bielefeld University, Germany

    Martin Milanič

Authors
  1. Vladimir E. Alekseev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vadim Lozin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dmitriy Malyshev
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Martin Milanič
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edward Ochmański Jerzy Tyszkiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alekseev, V.E., Lozin, V., Malyshev, D., Milanič, M. (2008). The Maximum Independent Set Problem in Planar Graphs. In: Ochmański, E., Tyszkiewicz, J. (eds) Mathematical Foundations of Computer Science 2008. MFCS 2008. Lecture Notes in Computer Science, vol 5162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85238-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85238-4_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85237-7

  • Online ISBN: 978-3-540-85238-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation