An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720
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.
- scientific article; zbMATH DE number 30298
- Performance evaluation of frequent subgraph discovery techniques
- Assessing the computational complexity of multi-layer subgraph detection
- Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
- Complexity results for generating subgraphs
- Subnetwork reliability analysis of bubble-sort graph networks
- Dynamic detection of subgraphs in computer networks
- Algorithm 457: finding all cliques of an undirected graph
- An Analysis of Some Graph Theoretical Cluster Techniques
- Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs
- On a New Approach for Finding All the Modified Cut-Sets in an Incompatibility Graph
- On cliques in graphs
This page was built for publication: An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1077167)
