3 citations · 3 across the 4 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2005★ 3 cited
Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs
G. Gutin, A. Rafiey, A. Yeo
For digraphs and , a mapping $f: V(D)\dom V(H)$ is a {\em homomorphism of to } if implies For a fixed directed or undirected graph $H…
cs.DM2005
Minimum Cost and List Homomorphisms to Semicomplete Digraphs
G. Gutin, A. Rafiey, A. Yeo
The following optimization problem was introduced in \cite{gutinDAM}, where it was motivated by a real-world problem in defence logistics. Suppose we are given a pair of digraphs $…