Skip to main content
SpringerLink
Log in

A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs

  • Conference paper
LATIN 2006: Theoretical Informatics (LATIN 2006)

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

Included in the following conference series:

Abstract

An algorithm is presented for finding a maximum independent set in a connected graph with n vertices and m edges in time O(poly(n)1.2365m − n). As a consequence, we find a maximum independent set in a graph of degree 3 in time O(poly(n)1.1120n), which improves the currently best results of O(1.1254n) of Chen, Kanj and Xia.

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. Tarjan, R.E., Trojanowski, A.E.: Finding a maximum independent set. SIAM J. Comput. 6, 537–546 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  2. Jian, T.: An O(20 . 3 0 4 n) algorithm for solving maximum independent set problems. IEEE Trans. Comput. 35, 847–851 (1986)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: SODA 1999: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, pp. 856–857 (1999)

    Google Scholar 

  5. Robson, J.M.: Finding a maximum independent set in time O(2n / 4)? Technical report, LaBRI, Université Bordeaux I (2001)

    Google Scholar 

  6. Chen, J., Kanj, I.A., Xia, G.: Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 148–157. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Dahllöf, V., Jonsson, P., Wahlström, M.: Counting models for 2SAT and 3SAT formulae. Theoretical Computer Science 332, 265–291 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Pennsylvania State University, University Park, PA, 16802, USA

    Martin Fürer

Authors
  1. Martin Fürer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Business, Universidad Adolfo Ibáñez, Chile

    José R. Correa

  2. Dept. of Computer Science, University of Chile, Blanco Encalada 2120, 3er piso, Santiago, Chile

    Alejandro Hevia

  3. Dept. Ing. Matemática & Ctr. de Modelamiento Matemático, UMI 2807 U. Chile–CNRS, Chile

    Marcos Kiwi

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fürer, M. (2006). A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_46

Download citation

  • DOI: https://doi.org/10.1007/11682462_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-32755-4

  • Online ISBN: 978-3-540-32756-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation