Skip to main content
SpringerLink
Log in

Counting Maximal Independent Sets in Subcubic Graphs

  • Conference paper
SOFSEM 2012: Theory and Practice of Computer Science (SOFSEM 2012)

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

Abstract

The main result of this paper is an algorithm counting maximal independent sets in graphs with maximum degree at most 3 in time O *(1.2570n) and polynomial space.

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. Alber, J., Niedermeier, R.: Improved Tree Decomposition Based Algorithms for Domination-like Problems. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 613–628. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput. 39(2), 546–563 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dahllöf, V., Jonsson, P., Wahlström, M.: Couning models for 2SAT and 3SAT formulae. Theor. Comput. Sci. 332, 265–291 (2005)

    Article  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Fürer, M., Kasiviswanathan, S.P.: Algorithms for Counting 2-Sat Solutions and Colorings with Applications. In: Kao, M.-Y., Li, X.-Y. (eds.) AAIM 2007. LNCS, vol. 4508, pp. 47–57. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Fomin, F.V., Gaspers, S., Saurabh, S., Stepanov, A.A.: On Two Techniques of Combining Branching and Treewidth. Algorithmica 54(2), 181–207 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gaspers, S., Kratsch, D., Liedloff, M.: On Independent Sets and Bicliques in Graphs. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol. 5344, pp. 171–182. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Greenhill, C.: The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. Comput. Complex 9, 52–73 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  10. Jou, M.J., Chang, G.J.: Algorithmic aspects of counting independent sets. Ars. Comb. 65, 265–277 (2002)

    MathSciNet  MATH  Google Scholar 

  11. Junosza-Szaniawski, K., Tuczyński, M.: Counting maximal independent sets in subcubic graphs, Tech Rep., www.mini.pw.edu.pl/~szaniaws

  12. Kullmann, O.: New methods for 3-SAT decision and worst-case analysis. Theor. Comput. Sci. 223(1-2), 1–72 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kutzkov, K.: New upper bound for the #3-SAT problem. Inform. Process. Lett. 105, 1–5 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lonc, Z., Truszczynski, M.: Computing minimal models, stable models and answer sets. Theory and Practice of Logic Prog. 6(4), 395–449 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  15. Vadhan, S.P.: The Complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM J. on Comput. 31, 398–427 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  16. Wahlström, M.: A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 202–213. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Information Science, Warsaw University of Technology, Pl. Politechniki 1/207, 00-661, Warsaw, Poland

    Konstanty Junosza-Szaniawski & Michał Tuczyński

Authors
  1. Konstanty Junosza-Szaniawski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michał Tuczyński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics and Information Technologies, Institute of Informatics and Software Engineering, Slovak University of Technology in Bratislava, Ilkovičova 3, 842 16, Bratislava 4, Slovakia

    Mária Bieliková

  2. Dept. of Intelligent Systems and Business Informatics, Alpen-Adria-Universität Klagenfurt, Universitätsstr. 65-57, 9020, Klagenfurt, Austria

    Gerhard Friedrich

  3. Department of Computer Science, University of Oxford, UK

    Georg Gottlob

  4. Security Engineering Group, Technische Universität Darmstadt, Hochschulstr. 10, 64289, Darmstadt, Germany

    Stefan Katzenbeisser

  5. University of Illinois at Chicago, Dept. of Math., Stat. and Comp. Sci, 851 S. Morgan Street, Chicago, IL 60607-7045, USA; and University of Szeged, Research Group on Artificial Intelligence of the Hungarian Academy of Sciences, 6701 Szeged, Postafiók, Hungary

    György Turán

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Junosza-Szaniawski, K., Tuczyński, M. (2012). Counting Maximal Independent Sets in Subcubic Graphs. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, G. (eds) SOFSEM 2012: Theory and Practice of Computer Science. SOFSEM 2012. Lecture Notes in Computer Science, vol 7147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27660-6_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27660-6_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27659-0

  • Online ISBN: 978-3-642-27660-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation