Sciweavers

Share
CSR
2009
Springer

New Plain-Exponential Time Classes for Graph Homomorphism

9 years 5 months ago
New Plain-Exponential Time Classes for Graph Homomorphism
A homomorphism from a graph G to a graph H (in this paper, both simple, undirected graphs) is a mapping f : V (G) → V (H) such that if uv ∈ E(G) then f(u)f(v) ∈ E(H). The problem Hom(G, H) of deciding whether there is a homomorphism is NP-complete, and in fact the fastest known algorithm for the general case has a running time of O∗ “ n(H)cn(G) ” ,1
Magnus Wahlström
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where CSR
Authors Magnus Wahlström
Comments (0)
books