Skip to main content
Log in

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

Leistungsabschätzung des MMSC Untergraphen-Erzeugungsalgorithmus bei Durchführung auf dem Cyber System 170/720

  • Short Communications
  • Published:
Computing Aims and scope Submit manuscript

Abstract

An algorithm for generating maximal minimally strongly connected (MMSC) subgraphs or cliques in undirected graphs has been suggested by Daset al. in a recent paper. 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.

Zusammenfassung

In einer kürzlich erfolgten Veröffentlichung von Daset al. wurde ein Algorithmus zur Erzeugung maximaler minimal stark zusammenhängender (MMSC) Untergraphen oder Cliquen in ungerichteten Graphen vorgeschlagen. Dieser Algorithmus basiert auf einer Verfeinerung der Technik der sukzessiven Aufspaltung, der von Paull und Unger eingeführt wurde. In der vorliegenden Arbeit wird das Leistungsverhalten dieses Algorithmus bei Implementierung in FORTRAN IV mit dem System Cyber 170/720 untersucht.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Paull, M. C., Unger, S. H.: Minimizing the number of states in incompletely specified sequential switching functions. IRE Trans.EC-8, 356–367 (1959).

    Google Scholar 

  2. Moon, J. W., Moser, L.: On cliques in graphs. Israel J. Math.3, 23–28 (1965).

    Google Scholar 

  3. Augustson, J. G., Minker, J.: An analysis of some graph theoretical cluster techniques. J. ACM17, 571–588 (1970).

    Google Scholar 

  4. Das, S. R.: On a new approach for finding all the modified cut-sets in an incompatibility graph. IEEE Trans.C-22, 187–193 (1973).

    Google Scholar 

  5. Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph. Comm. ACM16, 575–577 (1973).

    Google Scholar 

  6. Das, S. R., Sheng, C. L., Chen, Z., Lin, T.: Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs. Comp. Elec. Engg.6, 139–151 (1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was supported in part by the National Science Council of the Republic of China, and by the Natural Sciences and Engineering Research Council of Canada under Grant A4750.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Das, S.R., Lee, S.Y. An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber System 170/720. Computing 37, 365–370 (1986). https://doi.org/10.1007/BF02251094

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02251094

Key words

Navigation