Showing papers on "K-tree published in 1983"
TL;DR: The present paper discusses the implementation of the above subgraph generation algorithm in a Cyber System 172 using FORTRAN IV, and attempts to evaluate its performance characteristics as well as complexity for both small and large graphs, with particular reference to cluster analysis.
Abstract: In a recent paper an algorithm for generating maximal minimally strongly connected subgraphs or cliques in undirected graphs has been proposed by Das et al This algorithm is based on a refinement of the technique of successive splitting described by Pauli and Unger in the determination of maximal compatibles of states in the context of minimization of incomplete sequential machines. The present paper discusses the implementation of the above subgraph generation algorithm in a Cyber System 172 using FORTRAN IV, and attempts to evaluate its performance characteristics as well as complexity for both small and large graphs, with particular reference to cluster analysis.