An algorithm for partitioning the nodes of a graph

1 December 1981

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

Vol. 20, 303-304
https://doi.org/10.1109/cdc.1981.269534

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

PARTITIONING ALGORITHMS
SYMMETRIC MATRICES
HEURISTIC ALGORITHMS
SPARSE MATRICES
JOINING PROCESSES
MATRIX DECOMPOSITION

Cited by 22 articles