In this paper we consider the problem of k-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the objective of minimizing the sum of the costs of the edges between the subsets of the partition. Based on a study of...

No abstract

The partitioning of random graphs is investigated numerically using “simulated annealing” and “extremal optimization”. While generally in an NP-hard problem, it is shown that the optimization of the graph partitions is particularly difficult for sparse graphs with average connectivities...