×
Das, Sunil R.; Chen, Zen; Lee, S. Y.; Lin, Tony; Sheng, C. L.

Complexity and performance of a graph theory algorithm for cluster analysis. (English) Zbl 0497.68038

Int. J. Comput. Math. 13, 41-50 (1983).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0497.68038

MSC:

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

Keywords:

algorithm for generating maximal minimally strongly connected subgraphs or cliques in undirected graphs; implementation of the subgraph generation algorithm
Cite Review PDF
Full Text: DOI

References:

[1] Berge C., The Theory of Graphs and its Applications (1966) · Zbl 0097.38903
[2] Seshu S., Linear Graphs and Electrical Networks (1961) · Zbl 0102.34001
[3] Paull M.C., IRE Trans. Electron. Comput 8 pp 356– (1959) · doi:10.1109/TEC.1959.5222697
[4] Das S.R., Proc. IEEE 57 pp 694– (1969) · doi:10.1109/PROC.1969.7028
[5] Davio, M. 1969. ”Algebraic research of the maximal compatibility classes for incompletely specified sequential machines”. Brussels Rep. R118, M.B.L.E.
[6] Weissman J., Amer. Math. Mon 69 pp 608– (1962) · Zbl 0221.05063 · doi:10.2307/2310823
[7] Stoffers K.E., Trans. Res 2 pp 199– (1968) · doi:10.1016/0041-1647(68)90016-6
[8] Das S.R., IEEE Trans. Comput 22 pp 187– (1973) · Zbl 0253.05135 · doi:10.1109/T-C.1973.223683
[9] Stoffers K.E., IEEE Trans. Comput 23 pp 95– (1974) · Zbl 0277.05142 · doi:10.1109/T-C.1974.223786
[10] Nieminen J., Proc. IEEE 63 pp 729– (1975) · doi:10.1109/PROC.1975.9817
[11] Augustson J.G., J. ACM 17 pp 571– (1970) · Zbl 0206.17701 · doi:10.1145/321607.321608
[12] Mulligan G.D., Algorithms for Finding Cliques of a Graph
[13] Mulligan G.D., J. ACM 19 pp 244– (1972) · Zbl 0247.68010 · doi:10.1145/321694.321698
[14] Bron C., Comm. ACM 16 pp 575– (1973) · Zbl 0261.68018 · doi:10.1145/362342.362367
[15] Tarjan R.E., Finding a Maximum Clique (1972)
[16] Moon J.W., Israel J. Math 3 pp 23– (1965) · Zbl 0144.23205 · doi:10.1007/BF02760024
[17] Aho A.V., The Design and Analysis of Computer Algorithms (1975)
[18] Ramamoorthy C.V., J. ACM 13 pp 211– (1966) · Zbl 0141.21503 · doi:10.1145/321328.321332
[19] Das S.R., Comput, Elect. Engng 6 pp 139– (1979) · Zbl 0421.68063 · doi:10.1016/0045-7906(79)90002-8
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.