Encyclopedia of Algorithms

2008 Edition
| Editors: Ming-Yang Kao

Exact Graph Coloring Using Inclusion–Exclusion

2006; Björklund, Husfeldt
  • Andreas Björklund
  • Thore Husfeldt
Reference work entry
DOI: https://doi.org/10.1007/978-0-387-30162-4_134

Keywords and Synonyms

Vertex coloring  

Problem Definition

k-coloring of a graph \( G=(V,E) \)

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

Recommended Reading

  1. 1.
    Björklund, A., Husfeldt, T.: Exact algorithms for exact satisfiability and number of perfect matchings. In: Proc. 33rd ICALP. LNCS, vol. 4051, pp. 548–1559. Springer (2006). Algorithmica, doi:10.1007/s00453-007-9149-8Google Scholar
  2. 2.
    Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion–exclusion. SIAM J. Comput.Google Scholar
  3. 3.
    Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), San Diego, CA, June 11–13, 2007. Association for Computing Machinery, pp. 67–74. New York (2007)Google Scholar

Copyright information

© Springer-Verlag 2008

Authors and Affiliations

  • Andreas Björklund
    • 1
  • Thore Husfeldt
    • 1
  1. 1.Department of Computer ScienceLund UniversityLundSweden