![Sample our Bioscience journals, sign in here to start your access, Latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5925/TOC-Subject-Sample-2021-Bioscience.jpg"})
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.
†This research was supported in part by the National Science Council of the Republic of China.
‡Sunil R. Das was formerly with the Department of Electrical Engineering, Faculty of Science and Engineering, University of Ottawa, Ottawa, Ontario, Canada, and with the Institute of Radiophysics and Electronics, University of Calcutta, Calcutta, West Bengal, India.
†This research was supported in part by the National Science Council of the Republic of China.
‡Sunil R. Das was formerly with the Department of Electrical Engineering, Faculty of Science and Engineering, University of Ottawa, Ottawa, Ontario, Canada, and with the Institute of Radiophysics and Electronics, University of Calcutta, Calcutta, West Bengal, India.
Notes
†This research was supported in part by the National Science Council of the Republic of China.
‡Sunil R. Das was formerly with the Department of Electrical Engineering, Faculty of Science and Engineering, University of Ottawa, Ottawa, Ontario, Canada, and with the Institute of Radiophysics and Electronics, University of Calcutta, Calcutta, West Bengal, India.