Moving Clusters within a Memetic Algorithm for Graph Partitioning

<table class="table-group" id="tab7"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td align="left">Graph</td><td align="center">Number of vertices</td><td align="center">Number of edges</td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td align="left">nasa4704</td><td align="center">4704</td><td align="center">50026</td></tr><tr><td align="left">bcspwr09</td><td align="center">1723</td><td align="center">2394</td></tr><tr><td align="left">bcsstk13</td><td align="center">2003</td><td align="center">40940</td></tr><tr><td align="left">DEBR12</td><td align="center">4096</td><td align="center">8189</td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Mathematical Problems in Engineering

tab7

Table 7

Table 7: Moving Clusters within a Memetic Algorithm for Graph Partitioning 