| [1] |
Anderberg, M. R., Cluster Analysis for Applications (1973), Academic Press: Academic Press New York · Zbl 0299.62029 |
| [2] |
Buckley, F.; Harary, F., Distance in Graphs (1990), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0688.05017 |
| [3] |
Even, S., Graph Algorithms (1979), Computer Science Press: Computer Science Press Potomac, MD · Zbl 0441.68072 |
| [4] |
Gomory, R. E.; Hu, T. C., Multy-terminal networks flows, SIAM J. Appl. Math., Vol. 9, 551-570 (1961) · Zbl 0112.12405 |
| [5] |
Hansen, P.; Jaumard, B., Cluster analysis and mathematical programming, Math. Programming, Vol. 79, 191-215 (1997) · Zbl 0887.90182 |
| [6] |
Hartigan, J. A., Clustering Algorithms (1975), John Wiley and Sons: John Wiley and Sons New York · Zbl 0321.62069 |
| [7] |
Hartuv, E., Cluster analysis by highly connected subgraphs with applications to cDNA clustering (1998), Department of Computer Science, Tel Aviv University, Master’s Thesis |
| [8] |
Hartuv, E.; Schmitt, A.; Lange, J.; Meier-Ewert, S.; Lehrach, H.; Shamir, R., An algorithm for clustering cDNAs for gene expression analysis using short oligonucleotide fingerprints, (Proc. 3rd International Symposium on Computational Molecular Biology (RECOMB’99) (1999)), 188-197 |
| [9] |
Hartuv, E.; Schmitt, A.; Lange, J.; Meier-Ewert, S.; Lehrach, H.; Shamir, R., An algorithm for clustering cDNA fingerprints, Genomics, Vol. 66, 3, 249-256 (2000) |
| [10] |
Jardine, N.; Sibson, R., Mathematical Taxonomy (1971), John Wiley and Sons: John Wiley and Sons London · Zbl 0322.62065 |
| [11] |
Karger, D., Minimum cuts in near-linear time, (Proc. STOC’96 (1996), ACM Press: ACM Press New York) · Zbl 0922.68089 |
| [12] |
Matula, D. W., The cohesive strength of graphs, (Chartrand, G.; Kapoor, S. F., The Many Facets of Graph Theory. The Many Facets of Graph Theory, Lecture Notes in Math., Vol. 110 (1969), Springer: Springer Berlin), 215-221 · Zbl 0196.27204 |
| [13] |
Matula, D. W., Cluster analysis via graph theoretic techniques, (Mullin, R. C.; Reid, K. B.; Roselle, D. P., Proc. Louisiana Conference on Combinatorics, Graph Theory and Computing (1970), University of Manitoba: University of Manitoba Winnipeg), 199-212 · Zbl 0222.05125 |
| [14] |
Matula, D. W., \(k\)-Components, clusters and slicings in graphs, SIAM J. Appl. Math., Vol. 22, 3, 459-480 (1972) · Zbl 0243.05111 |
| [15] |
Matula, D. W., Graph theoretic techniques for cluster analysis algorithms, (van Ryzin, J., Classification and Clustering (1977), Academic Press: Academic Press New York), 95-129 |
| [16] |
Matula, D. W., Determining edge connectivity in \(O(nm)\), (Proc. 28th IEEE Symposium on Foundations of Computer Science (1987)), 249-251 |
| [17] |
Milosavljevic, A.; Strezoska, Z.; Zeremski, M.; Grujic, D.; Paunesku, T.; Crkvenjakov, R., Clone clustering by hybridization, Genomics, Vol. 27, 83-89 (1995) |
| [18] |
Mirkin, B., Mathematical Classification and Clustering (1996), Kluwer: Kluwer Dordrecht · Zbl 0874.90198 |
| [19] |
Nagamochi, H.; Ibaraki, T., Computing edge connectivity in multigraphs and capacitated graphs, SIAM J. Discrete Math., Vol. 5, 54-66 (1992) · Zbl 0754.05062 |
| [20] |
Sneath, P. H.A.; Sokal, R. R., Numerical Taxonomy (1973), Freeman: Freeman San Francisco · Zbl 0285.92001 |
| [21] |
Sokal, R. R., Clustering and classification: Background and current directions, (Classification and Clustering (1977), Academic Press: Academic Press New York), 1-15 |
| [22] |
Wu, Z.; Leahy, R., An optimal graph theoretic approach to data clustering: theory and its application to image segmentation, IEEE Trans. Pattern Analysis Machine Intelligence, Vol. 15, 11, 1101-1113 (1993) |
