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

DOI10.1007/BF02251094zbMath0594.68057OpenAlexW371648891MaRDI QIDQ1077167

B. George

Publication date: 1986

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02251094

zbMATH Keywords

cluster analysiscliquesmaximalundirected graphscompatiblesFORTRAN IVmaximal minimally strongly connected subgraphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Uses Software

• Algorithm 457

Cites Work

• Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs
• An Analysis of Some Graph Theoretical Cluster Techniques
• On a New Approach for Finding All the Modified Cut-Sets in an Incompatibility Graph
• Algorithm 457: finding all cliques of an undirected 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