Abstract
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if G is k-colorable. During the recent years the topic of exact (exponential-time) algorithms for NP-hard problems in general, and for graph coloring in particular, has led to extensive research. Consequently, it is natural to ask how the techniques developed for exact graph coloring algorithms can be extended to graph homomorphisms. By the celebrated result of Hell and Nešetřil, for each fixed simple graph H, deciding whether a given simple graph G has a homomorphism to H is polynomial-time solvable if H is a bipartite graph, and NP-complete otherwise. The case where H is a cycle of length 5 is the first NP-hard case different from graph coloring. We show that, for a given graph G on n vertices and an odd integer k≥ 5, whether G is homomorphic to a cycle of length k can be decided in time min\(\{(^{~n}_{n/k}), 2^{n/2}\} \cdot n^{\mathcal{O}(1)}\). We extend the results obtained for cycles, which are graphs of treewidth two, to graphs of bounded treewidth as follows: If H is of treewidth at most t, then whether G is homomorphic to H can be decided in time \((2t + 1)^n \cdot n^{\mathcal{O}(1)}\).
This work is supported by the AURORA mobility programme for research collaboration between France and Norway.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aspvall, B., Plass, M., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters 8, 21–123 (1979)
Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small reewidth. SIAM J. Comput. 25, 1305–1317 (1996)
Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209, 1–45 (1998)
Beigel, R., Eppstein, D.: 3-coloring in time O(1.3289n). Journal of Algorithms 54, 444–453 (2005)
Byskov, J.M.: Enumerating maximal independent sets with applications to graph olouring. Operations Research Letters 32, 547–556 (2004)
Byskov, J.M., Eppstein, D.: An algorithm for enumerating maximal bipartite ubgraphs (Unpublished)
Dalmau, V., Kolaitis, P.G., Vardi, Y.M.: Constraint satisfaction, bounded treewidth, and finite-variable logics. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 310–326. Springer, Heidelberg (2002)
Diaz, J., Serna, M., Thilikos, D.M.: Counting H-colorings of partial k-trees. heoretical Computer Science 281, 291–309 (2002)
Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, New York (1999)
Fomin, F., Kratsch, D., Todinca, I.: Exact (exponential) algorithms for treewidth nd min fill-in. In: Proceedings of the 31st International Colloquium on Automata, anguages and Programming (ICALP 2004). LNCS, vol. 3124, pp. 568–580. Springer-, Heidelberg (2004)
Grohe, M.: The complexity of homomorphism and constraint satisfaction problems een from the other side. In: Proceedings of the 44th Annual IEEE Symposium on oundations of Computer Science (FOCS 2003), pp. 552–561 (2003)
Hell, P., Nešetřil, J.: On the complexity of H-coloring. Journal of Combinatorial heory Series B 48, 92–110 (1990)
Hell, P., Nešetřil, J.: Graphs and Homomorphisms. New Oxford University Press, Oxford (2004)
Hujter, M., Tuza, Z.: The number of maximal independent sets in triangle-free graphs. SIAM Journal on Discrete Mathematics 6, 284–288 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fomin, F.V., Heggernes, P., Kratsch, D. (2005). Exact Algorithms for Graph Homomorphisms. In: Liśkiewicz, M., Reischuk, R. (eds) Fundamentals of Computation Theory. FCT 2005. Lecture Notes in Computer Science, vol 3623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11537311_15
Download citation
DOI: https://doi.org/10.1007/11537311_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28193-1
Online ISBN: 978-3-540-31873-6
eBook Packages: Computer ScienceComputer Science (R0)