Complexity and performance of a graph theory algorithm for cluster analysis†

DOI10.1080/00207168308803350MaRDI QIDQ3962478zbMATH OpenOpenAlexFDO

Authors Zen Chen, Suh-Yin Lee, C. L. Sheng, Sunil R. Das, T. C. Lin

Publication date 1983

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168308803350

zbMATH Keywords

algorithm for generating maximal minimally strongly connected subgraphs or cliques in undirected graphsimplementation of the subgraph generation algorithm

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to statistics (62-04) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Algorithm 457: finding all cliques of an undirected graph
• An Analysis of Some Graph Theoretical Cluster Techniques
• Analysis of Graphs by Connectivity Considerations
• Boolean Algebra, Map Coloring, and Interconnections
• Corrections to Bierstone's Algorithm for Generating Cliques
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3167398 (Why is no real title available?)
• 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
• Sequential Algorithm for the Determination of Maximum Compatibles

This page was built for publication: Complexity and performance of a graph theory algorithm for cluster analysis†

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962478)