Exact algorithms for graph homomorphisms

Theory of Computing Systems

Volumn 41, Issue 2, 2007, Pages 381-393

  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

BIPARTITE GRAPHS; BOUNDED TREEWIDTH; COMPLETE GRAPHS; EXACT ALGORITHMS; GRAPH COLORINGS; GRAPH HOMOMORPHISMS; NATURAL GENERALIZATION; POLYNOMIAL-TIME;

ALGORITHMS; COMPUTATIONAL COMPLEXITY;

GRAPH THEORY;

EID: 34547404100     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-007-2007-x     Document Type: Conference Paper

References (19)

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 Journal on Computing 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), pp. 310-326. LNCS 2470. Springer-Verlag, Berlin, 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), pp. 568-580. LNCS 3124. Springer-Verlag, Berlin, 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), pp. 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-1.10.
13. P. Hell and J. Nešetřil. Graphs and Homomorphisms. Oxford University Press, Oxford, 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.
15. T. Kloks. Treewidth. Computations and Approximation. LNCS 842. Springer-Verlag, Berlin, 1994.
16. J. W. Moon and L. Moser. On cliques in graphs. Israel Journal of Mathematics 3 (1965), 23-28.
17. N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms 7 (1986), 309-322.
18. Y. Villanger. Improved exponential-time algorithms for treewidth and minimum fill-in. In Proceedings of the 7th Latin American Symposium (LATIN 2006), pp. 800-8.11. LNCS 3887. Springer-Verlag, Berlin, 2006.
19. R. Williams. A new algorithm, for optimal constraint satisfaction and its implications. Theoretical Computer Science 348 (2005), 357-365.