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

†This research was supported in part by the National Science Council of the Republic of China.

References

• Berge , C. 1966 . The Theory of Graphs and its Applications , London : Methuen .
   Google Scholar
• Seshu , S. and Reed , B. 1961 . Linear Graphs and Electrical Networks , Reading, MS : Addison-Wesley .
   Google Scholar
• Paull , M.C. and Unger , S.H. 1959 . Minimizing the number of states in incompletely specified sequential switching functions . IRE Trans. Electron. Comput , EC-8 : 356 – 367 .
   Google Scholar
• Das , S.R. and Sheng , C.L. 1969 . On finding maximum compatibles . Proc. IEEE , 57 : 694 – 695 .
   Google Scholar
• Davio , M. 1969 . “ Algebraic research of the maximal compatibility classes for incompletely specified sequential machines ” . Brussels Rep. R118, M.B.L.E.
   Google Scholar
• Weissman , J. 1962 . Boolean algebra, map coloring, and interconnections . Amer. Math. Mon , 69 : 608 – 613 .
   Google Scholar
• Stoffers , K.E. 1968 . Scheduling of traffic lights—a new approach . Trans. Res , 2 : 199 – 234 .
   Google Scholar
• Das , S.R. 1973 . On a new approach for finding all the modified cut-sets in an incompatibility graph . IEEE Trans. Comput , C-22 : 187 – 193 .
   Google Scholar
• Stoffers , K.E. 1974 . IEEE Trans. Comput , C-23 : 95 – 98 .
   Google Scholar
• Nieminen , J. 1975 . Proc. IEEE , 63 : 729 – 730 .
   Google Scholar
• Augustson , J.G. and Minker , J. 1970 . An analysis of some graph theoretical cluster techniques . J. ACM , 17 : 571 – 588 .
   Web of Science ®Google Scholar
• Bierstone E. Cliques and generalized cliques in a finite linear graph Unpublished report
   Google Scholar
• Mulligan , G.D. Algorithms for Finding Cliques of a Graph , Toronto, , Canada : Univ. of Toronto . M,Sc. thesis, Dept. of Comp. Sc,, Ont.
   Google Scholar
• Mulligan , G.D. and Cornell , D.G. 1972 . Corrections to Bierstone's algorithm for generating Cliques . J. ACM , 19 : 244 – 247 .
   Google Scholar
• Bron , C. and Kerbosch , J. 1973 . Finding all cliques of an undirected graph . Comm. ACM , 16 : 575 – 577 .
   Web of Science ®Google Scholar
• Tarjan , R.E. 1972 . Finding a Maximum Clique , Ithaca, NY : Cornell Univ . Tech. Rep. TR-72-123, Dept. of Comp. Sc
   Google Scholar
• Moon , J.W. and Moser , L. 1965 . On Cliques in graphs . Israel J. Math , 3 : 23 – 28 .
   Web of Science ®Google Scholar
• Aho , A.V. , Hopcroft , J.E. and Ullman , J.D. 1975 . The Design and Analysis of Computer Algorithms , Reading, MS : Addison-Wesley .
   Google Scholar
• Ramamoorthy , C.V. 1966 . Analysis of graphs by connectivity considerations . J. ACM , 13 : 211 – 222 .
   Google Scholar
• Das , S.R. , Sheng , C.L. , Chen , Z. and Lin , T. 1979 . Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs . Comput, Elect. Engng , 6 : 139 – 151 .
   Google Scholar