Agent Arrangement Problem

Tomoki Nakamigawa, Tadashi Sakuma

An {\em arrangement} of an ordered pair $(G_A,G_M)$ of graphs is defined as a function $f$ from $V(G_A)$ to $V(G_M)$ such that, for each vertex $c$ of $G_M$, the vertex-set $f^{-1…