Sciweavers

7 search results - page 1 / 2
» Minimum cost and list homomorphisms to semicomplete digraphs
Sort
View
DAM
2006
76views more  DAM 2006»
13 years 10 months ago
Minimum cost and list homomorphisms to semicomplete digraphs
Gregory Gutin, Arash Rafiey, Anders Yeo
CORR
2007
Springer
119views Education» more  CORR 2007»
13 years 10 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...
CORR
2006
Springer
128views Education» more  CORR 2006»
13 years 10 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
DAM
2008
129views more  DAM 2008»
13 years 11 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