An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720 (Q1077167)

An algorithm for generating maximal minimally strongly connected (MMSC) subgraphs or cliques in undirected graphs has been suggested by the first author, \textit{C. L. Sheng}, \textit{Z. Chen}, and \textit{T. Lin} [Comput. Electr. Eng. 6, 139-151 (1979; Zbl 0421.68063)]. The proposed algorithm is based on a refinement of the technique of successive splitting described by Paull and Unger in the determination of maximal compatibles of states in the context of minimization of incomplete sequential machines. The present paper discusses the performance of the aforementioned subgraph generation algorithm in an implementation on Cyber System 170/720 using FORTRAN IV, in particular reference to cluster analysis.