Research Article

Moving Clusters within a Memetic Algorithm for Graph Partitioning

Table 1

Probability that KL fails to return vertices moved from one subset of a partition to the other, when the vertices are in cluster () or chosen at random (), over 1,000 runs.

Graph (%) (%)Average number of vertices moved ()

G500.2.5
G500.05
G500.10
G500.20
G1000.2.5
G1000.05
G1000.10
G1000.20

U500.05
U500.10
U500.20
U500.40
U1000.05
U1000.10
U1000.20
U1000.40