Home » Author index

Fomin, Fedor V.


Graph Theory » Coloring » Homomorphisms

Algorithm for graph homomorphisms ★★

Author(s): Fomin; Heggernes; Kratsch

Question  

Is there an algorithm that decides, for input graphs $ G $ and $ H $, whether there exists a homomorphism from $ G $ to $ H $ in time $ O(c^{|V(G)|+|V(H)|}) $ for some constant $ c $?

Keywords: algorithm; Exponential-time algorithm; homomorphism

Posted by jfoniok
updated July 8th, 2010
add new comment
Syndicate content