Clique analysis of a tolerance relation

The Harary‐Ross clique detection algorithm has often been neglected in analyses of symmetric graphs and tolerance relations because of presumed storage and computation problems. This paper presents a modification of the original algorithm which overcomes these difficulties. The modified algorithm is shown to perform as well as other recent structurally different algorithms. Indeed, for arc densities which might be expected in typical sociometric analyses, the modified algorithm has certain conceptual and operational advantages. The paper also indicates possible applications of the algorithm in the analysis of non‐symmetric functional relations and points out the conceptual similarity with simplicial connectivity analysis.