Arvind Gupta

most citedMinimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs

3 citations · 3 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2014

Contraction Obstructions for Connected Graph Searching

Micah J. Best, Arvind Gupta, Dimitrios M. Thilikos +1

We consider the connected variant of the classic mixed search game where, in each search step, cleaned edges form a connected subgraph. We consider graph classes with bounded conne…

cs.DM2007★ 3 cited

Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs

A. Gupta, G. Gutin, M. Karimi +2

For digraphs $G$ and $H$ , a homomorphism of $G$ to $H$ is a mapping $f:\ V(G)\dom V(H)$ such that $uv \in A (G)$ implies $f (u) f (v) \in A (H)$ . If, moreover, each vertex $u \in V (G)$ is…

cs.DM2007

Minimum Cost Homomorphisms to Reflexive Digraphs

Arvind Gupta, Pavol Hell, Mehdi Karimi +1

For digraphs $G$ and $H$ , a homomorphism of $G$ to $H$ is a mapping $f:\ V(G)\dom V(H)$ such that $uv \in A (G)$ implies $f (u) f (v) \in A (H)$ . If moreover each vertex $u \in V (G)$ is a…