A stratificational overlapping cluster scheme

摘要

The threshold graph is defined for a set of overlapping clusters by a given threshold value, where a vertex 1-1 corresponds to a cluster. In this paper, a graph theoretic scheme to link overlapping clusters is proposed in terms of the maximal complete subgraph (MCS) of a threshold graph. Stratificational property is mathematically discussed and an algorithm SOCAL is presented to implement the proposed stratificational overlapping cluster scheme.