Improved exact algorithms for counting 3- and 4-colorings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4598 LNCS, Issue , 2007, Pages 65-74

  Fomin, Fedor V ^a   Gaspers, Serge ^a   Saurabh, Saket ^a,b  

^a UNIVERSITY OF BERGEN   (Norway)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER GRAPHICS; DYNAMIC PROGRAMMING;

GENERIC ALGORITHMIC; GRAPH COLORING;

GENE ENCODING;

EID: 37849030256     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73545-8_9     Document Type: Conference Paper

References (16)

1. Angelsmark, O., Jonsson, P.: Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 81-95. Springer, Heidelberg (2003)
2. n).. Journal of Algorithms 54(2), 168-204 (2005)
3. Björklund, A., Husfeldt, T.: Inclusion-Exclusion Algorithms for Counting Set Partitions. In: The Proceedings of FOCS 2006, pp. 575-582 (2006)
4. Byskov, J.M.: Exact Algorithms for Graph Colouring and Exact Satisfiability. PhD Dissertation (2004)
5. Byskov, J.M.: Enumerating Maximal Independent Sets with Applications to Graph Colouring. Operations Research Letters 32(6), 547-556 (2004)
6. Christofides, N.: An algorithm for the chromatic number of a graph. Computer J. 14, 38-39 (1971)
7. Eppstein, D.: Small Maximal Independent Sets and Faster Exact Graph Coloring. J. Graph Algorithms Appl. 7(2), 131-140 (2003)
8. Fomin, F.V., Gaspers, S., Saurabh, S., Stepanov, A.A.: On Two Techniques of Combining Branching and Treewidth. Report No 337, Department of Informatics, University of Bergen, Norway (December 2006)
9. Fomin, F.V., Høie, K.: Pathwidth of cubic graphs and exact algorithms. Information Processing Letters 97(5), 191-196 (2006)
10. Feige, U., Kilian, J.: Zero Knowledge and the Chromatic Number. Journal of Computer and System Sciences 57(2), 187-199 (1998)
11. Fürer, M., Kasiviswanathan, S.P.: Algorithms for counting 2-SAT solutions and colorings with applications. In: ECCC 33 (2005)
12. Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, CA (1979)
13. Khot, S., Ponnuswami, A.K.: Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 226-237. Springer, Heidelberg (2006)
14. n) algorithm for graph coloring and other partitioning problems via inclusion-exclusion. In: Proceedings of FOCS 2006, pp. 583-590 (2006)
15. Lawler, E.L.: A Note on the Complexity of the Chromatic Number. Information Processing Letters 5(3), 66-67 (1976)
16. Monien, B., Preis, R.: Upper bounds on the bisection width of 3- and 4-regular graphs. Discrete Algorithms 4(3), 475-498 (2006)