论文信息 - An algorithm for partitioning the nodes of a graph

An algorithm for partitioning the nodes of a graph

We present a heuristic algorithm for partitioning the nodes of a graph into a given number of subsets in such a way that the number of edges connecting the various subsets is a minimum. The sizes of the subsets must be specified in advance.

Earl R. Barnes

[1] E. Barnes. An algorithm for partitioning the nodes of a graph , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.