Skip to main content
SpringerLink
Log in

An O *(1.0977n) Exact Algorithm for max independent set in Sparse Graphs

  • Conference paper
Parameterized and Exact Computation (IWPEC 2008)

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

Included in the following conference series:

Abstract

We present an O *(1.0977n) search-tree based exact algorithm for max independent set in graphs with maximum degree 3. It can be easily seen that this algorithm also works in graphs with average degree 3.

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. Robson, J.M.: Finding a maximum independent set in time O(2n/4). Technical Report 1251-01, LaBRI, Université de Bordeaux I (2001)

    Google Scholar 

  2. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proc. Symposium on Discrete Algorithms, SODA 1999, pp. 856–857 (1999)

    Google Scholar 

  3. 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)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

  6. Razgon, I.: A faster solving of the maximum independent set problem for graphs with maximal degree 3. In: Proc. Algorithms and Complexity in Durham, ACiD 2006, pp. 131–142 (2006)

    Google Scholar 

  7. Wœginger, 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 

  8. Eppstein, D.: Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. In: Proc. Symposium on Discrete Algorithms, SODA 2001, pp. 329–337 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LAMSADE, CNRS UMR 7024 and Université Paris-Dauphine, Place du Maréchal De Lattre de Tassigny, 75775, Paris Cedex 16, France

    Nicolas Bourgeois, Bruno Escoffier & Vangelis Th. Paschos

Authors
  1. Nicolas Bourgeois
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bruno Escoffier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vangelis Th. Paschos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Martin Grohe Rolf Niedermeier

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bourgeois, N., Escoffier, B., Paschos, V.T. (2008). An O *(1.0977n) Exact Algorithm for max independent set in Sparse Graphs. In: Grohe, M., Niedermeier, R. (eds) Parameterized and Exact Computation. IWPEC 2008. Lecture Notes in Computer Science, vol 5018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79723-4_7

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation