105 citations
- Oranim Academic College of EducationIL4 papers
- Carmel (Israel)IL3 papers
- Royal Holloway University of LondonGB2 papers
- University of Notre DameUS2 papers
- Academic College of Tel Aviv-YafoIL1 paper
- Centrum Wiskunde & InformaticaNL1 paper
- Chalmers University of TechnologySE1 paper
- College of Western IdahoUS1 paper
- Hebrew University of JerusalemIL1 paper
- Massachusetts Institute of TechnologyUS1 paper
- Massey UniversityNZ1 paper
- Max Planck Institute for MathematicsDE1 paper
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 $…