An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720 (Q1077167)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3956455
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720 |
scientific article; zbMATH DE number 3956455 |
Statements
An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720 (English)
0 references
1986
0 references
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.
0 references
maximal minimally strongly connected subgraphs
0 references
maximal
0 references
compatibles
0 references
cliques
0 references
undirected graphs
0 references
FORTRAN IV
0 references
cluster analysis
0 references
0.76856816
0 references
0.7671133
0 references
0.76579463
0 references
0.7586967
0 references
0.7547629
0 references
0.75316155
0 references
