Sciweavers

7 search results - page 1 / 2
» Minimum Cost Homomorphism Dichotomy for Oriented Cycles
Sort
View
AAIM
2008
Springer
120views Algorithms» more  AAIM 2008»
14 years 1 days ago
Minimum Cost Homomorphism Dichotomy for Oriented Cycles
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...
Gregory Gutin, Arash Rafiey, Anders Yeo
CORR
2006
Springer
128views Education» more  CORR 2006»
13 years 5 months ago
Minimum Cost Homomorphisms to Semicomplete Bipartite 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). If, moreover, each vertex u V (D) is associated with costs ci(u), i...
Gregory Gutin, Arash Rafiey, Anders Yeo
STACS
2010
Springer
13 years 10 months ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov
EJC
2008
13 years 5 months ago
A dichotomy for minimum cost graph homomorphisms
Gregory Gutin, Pavol Hell, Arash Rafiey, Anders Ye...
CORR
2007
Springer
119views Education» more  CORR 2007»
13 years 5 months ago
Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs
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 ...
Arvind Gupta, Gregory Gutin, Mehdi Karimi, Eun Jun...