Validity of clusters formed by graph-theoretic cluster methods
- 1 January 1977
- journal article
- Published by Elsevier in Mathematical Biosciences
- Vol. 36 (3-4) , 299-317
- https://doi.org/10.1016/0025-5564(77)90053-0
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- Some Applications of Graph Theory to ClusteringPsychometrika, 1974
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- k-Components, Clusters and Slicings in GraphsSIAM Journal on Applied Mathematics, 1972
- On the theory and construction of k-clustersThe Computer Journal, 1972
- The Construction of Hierarchic and Non-Hierarchic ClassificationsThe Computer Journal, 1968
- A model for taxonomyMathematical Biosciences, 1968
- A mathematical model in graph theory for biological classificationJournal of Theoretical Biology, 1966
- THE MAXIMUM CONNECTIVITY OF A GRAPHProceedings of the National Academy of Sciences, 1962
- Sur la liaison et la division des points d'un ensemble finiColloquium Mathematicum, 1949