Exact algorithms for graph homomorphisms

Lecture Notes in Computer Science

Volumn 3623, Issue , 2005, Pages 161-171

  Fomin, Fedor V ^a   Heggernes, Pinar ^a   Kratsch, Dieter ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLOR; POLYNOMIALS;

GRAPH COLORING; GRAPH HOMOMORPHISMS; TREEWIDTH;

GRAPH THEORY;

EID: 26844472861     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11537311_15     Document Type: Conference Paper

References (14)

1. B. Aspvall, M. Plass, and R.E. Tarjan, A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters 8 (1979), 121-123.
2. H.L. Bodlaender, A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25 (1996), 1305-1317.
3. H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209 (1998), 1-45.
4. n). Journal of Algorithms 54 (2005), 444-453.
5. J. M. Byskov, Enumerating maximal independent sets with applications to graph colouring. Operations Research Letters 32 (2004), 547-556.
6. J. M. Byskov and D. Eppstein, An algorithm for enumerating maximal bipartite subgraphs. Unpublished.
7. V. Dalmau, P. G. Kolaitis, and M. Y. Vardi, Constraint satisfaction, bounded treewidth, and finite-variable logics. In Principles and Practice of Constraint Programming (CP 2002), Springer-Verlag, LNCS 2470, 310-326, 2002.
8. J. Diaz, M. Serna, and D.M. Thilikos, Counting H-colorings of partial k-trees. Theoretical Computer Science 281 (2002), 291-309.
9. R. G. Downey and M. R. Fellows, Parameterized complexity, Springer-Verlag, New York, 1999.
10. F. Fomin, D. Kratsch, and I. Todinca, Exact (exponential) algorithms for treewidth and min fill-in. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), Springer-Verlag, LNCS 3124, 568-580, 2004.
11. M. Grohe, The complexity of homomorphism and constraint satisfaction problems seen from the other side. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2003), 552-561, 2003.
12. P. Hell and J. Nešetřil, On the complexity of H-coloring. Journal of Combinatorial Theory Series B 48 (1990), 92-110.
13. P. Hell and J. Nešetřil, Graphs and Homomorphisms. New Oxford University Press, 2004.
14. M. Hujter and Z. Tuza, The number of maximal independent sets in triangle-free graphs. SIAM Journal on Discrete Mathematics 6 (1993), 284-288.