8 search results - page 1 / 2 » The Dichotomy of List Homomorphisms for Digraphs |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
For digraphs G and H, a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (G) is associated ...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
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). If, moreover, each vertex u V (D) is associated with costs ci(u), i...
AAIM
2008
Springer
13 years 11 months ago
2008
Springer
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). If, moreover, each vertex u ∈ V (D) is associated with co...