Moving Clusters within a Memetic Algorithm for Graph Partitioning

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/mpe/volume-2015/238529/figures/238529.fig.001a.svgz" name="238529.fig.001a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Before moving a cluster</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/mpe/volume-2015/238529/figures/238529.fig.001b.svgz" name="238529.fig.001b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>After moving a cluster</td></tr></table>

<div>An example of cluster moving, in which the cut size of a partition is reduced by 4.</div>

Mathematical Problems in Engineering

fig1

Figure 1

Figure 1: Moving Clusters within a Memetic Algorithm for Graph Partitioning 