3 citations · 3 across the 3 of their papers we have counts for
4 papers
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…
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 $…
Mediated Digraphs and Quantum Nonlocality
Gregory Gutin, Nick S. Jones, Arash Rafiey +2
A digraph D=(V,A) is mediated if, for each pair x,y of distinct vertices of D, either xy belongs to A or yx belongs to A or there is a vertex z such that both xz,yz belong to A. Fo…
Hamilton Cycles in Digraphs of Unitary Matrices
Gregory Gutin, Arash Rafiey, Simone Severini +1
A set is called an {\em -set} ({\em -set}, respectively) if has at least two vertices and, for every , there exists such that…