908356.fig.003a
(a) I: Good assignment (no costs)
908356.fig.003b
(b) II: Bad assignment (costly)
Figure 3: (a) (Case I) adjacent nodes and in the graph are assigned to adjacent nodes and in the graph . (b) (Case II) adjacent nodes and are no longer adjacent in the graph after the assignment. The left mapping leads to no additional costs while the right undesired mapping adds 1 to the total cost.