Skip to main content

Exact Graph Coloring Using Inclusion-Exclusion

  • Living reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Recommended Reading

  1. Björklund A, Husfeldt T (2008) Exact algorithms for exact satisfiability and number of perfect matchings. Algorithmica 52(2):226–249

    Article  MATH  MathSciNet  Google Scholar 

  2. Björklund A, Husfeldt T, Kaski P, Koivisto M (2007) Fourier meets Möbius: fast subset convolution. In: Proceedings of the 39th annual ACM symposium on theory of computing (STOC), San Diego, 11–13 June 2007. Association for Computing Machinery, New York, pp 67–74

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Björklund A, Husfeldt T, Kaski P, Koivisto M (2011) Covering and packing in linear space. Inf Process Lett 111(21–22):1033–1036

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andreas Björklund .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer Science+Business Media New York

About this entry

Cite this entry

Björklund, A., Husfeldt, T. (2015). Exact Graph Coloring Using Inclusion-Exclusion. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-3-642-27848-8_134-2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27848-8_134-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Boston, MA

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

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics