Skip to main content
SpringerLink
Log in
Book cover

International Conference on Combinatorial Optimization and Applications

COCOA 2011: Combinatorial Optimization and Applications pp 163–178Cite as

Further Improvement on Maximum Independent Set in Degree-4 Graphs

  • Conference paper

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

Abstract

We present a simple algorithm for the maximum independent set problem in an n-vertex graph with degree bounded by 4, which runs in O *(1.1526n) time and improves all previous algorithms for this problem. In this paper, we use the “Measure and Conquer method” to analyze the running time bound, and use some good reduction and branching rules to avoid tedious checking on a large number of local structures.

Partially supported by National Natural Science Foundation of China under the Grant 60903007.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: SODA 1999, pp. 856–857. ACM Press, New York (1999)

    Google Scholar 

  2. Bourgeois, N., Escoffier, B., Paschos, V.T., van Rooij, J.M.M.: Maximum independent set in graphs of average degree at most three in \({\mathcal O}(1.08537^n)\). In: Kratochvíl, J., Li, A., Fiala, J., Kolman, P. (eds.) TAMC 2010. LNCS, vol. 6108, pp. 373–384. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Bourgeois, N., Escoffier, B., Paschos, V.T., van Rooij, J.M.M.: A bottom-up method and fast algorithms for max independent set. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 62–73. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. 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 

  5. Chor, B., Fellows, M., Juedes, D.W.: Linear kernels in linear time, or how to save k colors in O(n 2) steps. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 257–269. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Eppstein, D.: Quasiconvex analysis of backtracking algorithms. In: SODA, pp. 781–790. ACM Press, New York (2004)

    Google Scholar 

  7. Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: a simple O(20.288n) independent set algorithm. In: SODA, pp. 18–25. ACM Press, New York (2006)

    Chapter  Google Scholar 

  8. Fomin, F.V., Høie, K.: Pathwidth of cubic graphs and exact algorithms. Inf. Process. Lett. 97(5), 191–196 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. 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 

  10. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1979)

    Google Scholar 

  11. 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 

  12. Kneis, J., Langer, A., Rossmanith, P.: A fine-grained analysis of a simple independent set algorithm. In: Kannan, R., Kumar, K.N. (eds.) FSTTCS 2009, Dagstuhl, Germany. LIPIcs, vol. 4, pp. 287–298 (2009)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  17. West, D.: Introduction to Graph Theory. Prentice Hall, Englewood Cliffs (1996)

    MATH  Google Scholar 

  18. Xiao, M., Chen, J.E., Han, X.L.: Improvement on vertex cover and independent set problems for low-degree graphs. Chinese J. of Computers 28(2), 153–160 (2005)

    MathSciNet  Google Scholar 

  19. 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 

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. Zhejiang Normal University, 688 Yingbin Road, 321004, Jinhua, Zhejiang Province, China

    Weifan Wang  & Xuding Zhu  & 

  2. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xiao, M., Nagamochi, H. (2011). Further Improvement on Maximum Independent Set in Degree-4 Graphs. In: Wang, W., Zhu, X., Du, DZ. (eds) Combinatorial Optimization and Applications. COCOA 2011. Lecture Notes in Computer Science, vol 6831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22616-8_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22616-8_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22615-1

  • Online ISBN: 978-3-642-22616-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation