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.
|