Skip to main content
SpringerLink
Log in

Exact Algorithms for Maximum Independent Set

  • Conference paper
Algorithms and Computation (ISAAC 2013)

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

Included in the following conference series:

Abstract

We show that the maximum independent set problem (MIS) on an n-vertex graph can be solved in 1.2002n n O(1) time and polynomial space, which is even faster than Robson’s 1.2109n n O(1)-time exponential-space algorithm published in 1986. We also obtain improved algorithms for MIS in graphs with maximum degree 6 and 7. Our algorithms are obtained by effectively using fast algorithms for MIS in low-degree graphs and making careful analyses for MIS in high-degree graphs.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bourgeois, N., Escoffier, B., Paschos, V.T., van Rooij, J.M.M.: Fast algorithms for max independent set. Algorithmica 62(1-2), 382–415 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theoretical Computer Science 411(40-42), 3736–3756 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Eppstein, D.: Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms. ACM Transactions on Algorithms 2(4), 492–509 (2006)

    Article  MathSciNet  Google Scholar 

  4. Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5), 1–32 (2009)

    Article  MathSciNet  Google Scholar 

  5. Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer (2010)

    Google Scholar 

  6. Fürer, M.: A faster algorithm for finding maximum independent sets in sparse graphs. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 491–501. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Jian, T.: An O(20.304n) algorithm for solving maximum independent set problem. IEEE Transactions on Computers 35(9), 847–851 (1986)

    Article  MATH  Google Scholar 

  8. Kneis, J., Langer, A., Rossmanith, P.: A fine-grained analysis of a simple independent set algorithm. In: FSTTCS 2009. LIPIcs, vol. 4, pp. 287–298 (2009)

    Google Scholar 

  9. Razgon, I.: Faster computation of maximum independent set and parameterized vertex cover for graphs with degree 3. J. of Disc. Alg. 7(2), 191–212 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Robson, J.: Algorithms for maximum independent sets. J. of Algorithms 7(3), 425–440 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  11. Robson, J.: Finding a maximum independent set in time O(2n/4). Technical Report 1251-01, LaBRI, Univsersite Bordeaux I (2001)

    Google Scholar 

  12. Tarjan, R., Trojanowski, A.: Finding a maximum independent set. SIAM J. on Computing 6(3), 537–546 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  13. West, D.: Introduction to Graph Theory. Prentice Hall (1996)

    Google Scholar 

  14. Woeginger, G.J.: Exact algorithms for NP-hard problems: A survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol. 2570, pp. 185–207. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Xiao, M.: A simple and fast algorithm for maximum independent set in 3-degree graphs. In: Rahman, M. S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 281–292. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  16. Xiao, M., Nagamochi, H.: Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs. Theoretical Computer Science 469, 92–104 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  17. Xiao, M., Nagamochi, H.: A refined algorithm for maximum independent set in degree-4 graphs. Technical report 2013-002, Kyoto University (2013), http://www.amp.i.kyoto-u.ac.jp/tecrep/abst/2013/2013-002.html

  18. Xiao, M., Nagamochi, H.: An exact algorithm for maximum independent set in degree-5 graphs. In: Fellows, M., Tan, X., Zhu, B. (eds.) FAW-AAIM 2013. LNCS, vol. 7924, pp. 72–83. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  19. http://www.tcs.rwth-aachen.de/independentset/

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, University of Electronic Science and Technology of China, China

    Mingyu Xiao

  2. Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan

    Hiroshi Nagamochi

Authors
  1. Mingyu Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroshi Nagamochi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Chinese University of Hong Kong, Shatin, 100084, Hong Kong, China

    Leizhen Cai

  2. Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Clear Water Bay, 100044, Hong Kong, China

    Siu-Wing Cheng

  3. Department of Computer Science, University of Hong Kong, Porfkulam, 100084, Hong Kong, China

    Tak-Wah Lam

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xiao, M., Nagamochi, H. (2013). Exact Algorithms for Maximum Independent Set. In: Cai, L., Cheng, SW., Lam, TW. (eds) Algorithms and Computation. ISAAC 2013. Lecture Notes in Computer Science, vol 8283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45030-3_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45030-3_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45029-7

  • Online ISBN: 978-3-642-45030-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation