ABSTRACT
This chapter describes a method for grouping an interrelated set of elements into subsets such that there is a maximum amount of communication within a subset and a minimum amount of communication between subsets. Relational problems can be described as those problems which involve the manipulation of an interrelated set of elements where each element and each element relation has associated with it a specific set of attributes. This class of relational problems can be described using graph theory. A graph consists of a set of junction points called “nodes” with certain pairs of the nodes being joined by “links”. A similarity of pattern exists between the graph and the matrix tabulation; there are two clusters of elements in the graph and there are two clusters of one’s in the matrix. The property of a cluster is such that there is a maximum amount of communication within a cluster and a minimum amount of communication between clusters.
