Anders Yeo

activity

20042009

most citedMinimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs

8 citations · 25 across the 11 of their papers we have counts for

collaborators

Showing 2006Show all

3 papers · 1 filter

cs.DM2006

Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs

G. Gutin, A. Rafiey, A. Yeo

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

cs.DS2006★ 3 cited

Fixed-Parameter Complexity of Minimum Profile Problems

Gregory Gutin, Stefan Szeider, Anders Yeo

Let $G = (V, E)$ be a graph. An ordering of $G$ is a bijection $α: V\dom \{1,2,..., |V|\}.$ For a vertex $v$ in $G$ , its closed neighborhood is $N [v] = {u \in V : uv \in E} \cup {v} .$ T…

cs.DM2006★ 8 cited

Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs

G. Gutin, P. Hell, A. Rafiey +1

For graphs $G$ and $H$ , a mapping $f: V(G)\dom V(H)$ is a homomorphism of $G$ to $H$ if $uv \in E (G)$ implies $f (u) f (v) \in E (H) .$ If, moreover, each vertex $u \in V (G)$ is associate…