VALIDITY OF CLUSTERS FORMED BY GRAPH-THEORETIC CLUSTER METHODS

[1] DAY WHE, 1975, CP75018 S METH U DEP

[2] DAY WHE, 1976, CS7606 S METH U DEP

[3] DAY WHE, 1976, CS76011 S METH U DEP

[4] A MATHEMATICAL MODEL IN GRAPH THEORY FOR BIOLOGICAL CLASSIFICATION [J]. JOURNAL OF THEORETICAL BIOLOGY, 1966, 12 (03) : 297 - +

[5] Even S., 1975, SIAM Journal on Computing, V4, P507, DOI 10.1137/0204043

[6] Florek K, 1951, COLLOQ MATH-WARSAW, V2, P282, DOI DOI 10.4064/CM-2-3-4-282-285

[7] MAXIMUM CONNECTIVITY OF A GRAPH [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1962, 48 (07) : 1142 - &

[8] HARARY F, 1969, GRAPH THEORY, P47

[9] EFFICIENT ALGORITHMS FOR GRAPH MANIPULATION [J]. COMMUNICATIONS OF THE ACM, 1973, 16 (06) : 372 - 378

[10] SOME APPLICATIONS OF GRAPH THEORY TO CLUSTERING [J]. PSYCHOMETRIKA, 1974, 39 (03) : 283 - 309

[1] DAY WHE, 1975, CP75018 S METH U DEP

[2] DAY WHE, 1976, CS7606 S METH U DEP

[3] DAY WHE, 1976, CS76011 S METH U DEP

[4] A MATHEMATICAL MODEL IN GRAPH THEORY FOR BIOLOGICAL CLASSIFICATION [J]. JOURNAL OF THEORETICAL BIOLOGY, 1966, 12 (03) : 297 - +

[5] Even S., 1975, SIAM Journal on Computing, V4, P507, DOI 10.1137/0204043

[6] Florek K, 1951, COLLOQ MATH-WARSAW, V2, P282, DOI DOI 10.4064/CM-2-3-4-282-285

[7] MAXIMUM CONNECTIVITY OF A GRAPH [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1962, 48 (07) : 1142 - &

[8] HARARY F, 1969, GRAPH THEORY, P47

[9] EFFICIENT ALGORITHMS FOR GRAPH MANIPULATION [J]. COMMUNICATIONS OF THE ACM, 1973, 16 (06) : 372 - 378

[10] SOME APPLICATIONS OF GRAPH THEORY TO CLUSTERING [J]. PSYCHOMETRIKA, 1974, 39 (03) : 283 - 309