Sciweavers

8 search results - page 2 / 2
» The Dichotomy of List Homomorphisms for Digraphs
Sort
View
DAM
2006
76views more  DAM 2006»
13 years 5 months ago
Minimum cost and list homomorphisms to semicomplete digraphs
Gregory Gutin, Arash Rafiey, Anders Yeo
DAM
2008
129views more  DAM 2008»
13 years 5 months ago
Minimum cost homomorphisms to semicomplete multipartite digraphs
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...
Gregory Gutin, Arash Rafiey, Anders Yeo
ICALP
2007
Springer
13 years 11 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson