Title :
An algorithm for partitioning the nodes of a graph
Author_Institution :
IBM Thomas J. Watson Research Center, Yorktown Heights, New York
Abstract :
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.
Keywords :
Heuristic algorithms; Joining processes; Matrix decomposition; Partitioning algorithms; Sparse matrices; Symmetric matrices;
Conference_Titel :
Decision and Control including the Symposium on Adaptive Processes, 1981 20th IEEE Conference on
Conference_Location :
San Diego, CA, USA
DOI :
10.1109/CDC.1981.269534
