CLUSTERING TO MINIMIZE THE MAXIMUM INTERCLUSTER DISTANCE

[1] [Anonymous], 1972, COMPUTER ORIENTED AP

[2] AN ANALYSIS OF SOME GRAPH THEORETICAL CLUSTER TECHNIQUES [J]. JOURNAL OF THE ACM, 1970, 17 (04) : 571 - &

[3] Bock HH, 1974, AUTOMATISCHE KLASSIF

[4] BODIN L, 1972, NETWORKS, V2, P307

[5] BRUCKER P, 1977, LECTURE NOTES EC MAT

[6] Duda R. O., 1973, PATTERN CLASSIFICATI

[7] FISHER L, 1971, BIOMETRIKA, V58, P91, DOI 10.2307/2334320

[8] ON GROUPING FOR MAXIMUM HOMOGENEITY [J]. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1958, 53 (284) : 789 - 798

[9] Garey M., 1980, COMPUTERS INTRACTABI

[10] COMPLEXITY OF NEAR-OPTIMAL GRAPH COLORING [J]. JOURNAL OF THE ACM, 1976, 23 (01) : 43 - 49

[1] [Anonymous], 1972, COMPUTER ORIENTED AP

[2] AN ANALYSIS OF SOME GRAPH THEORETICAL CLUSTER TECHNIQUES [J]. JOURNAL OF THE ACM, 1970, 17 (04) : 571 - &

[3] Bock HH, 1974, AUTOMATISCHE KLASSIF

[4] BODIN L, 1972, NETWORKS, V2, P307

[5] BRUCKER P, 1977, LECTURE NOTES EC MAT

[6] Duda R. O., 1973, PATTERN CLASSIFICATI

[7] FISHER L, 1971, BIOMETRIKA, V58, P91, DOI 10.2307/2334320

[8] ON GROUPING FOR MAXIMUM HOMOGENEITY [J]. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1958, 53 (284) : 789 - 798

[9] Garey M., 1980, COMPUTERS INTRACTABI

[10] COMPLEXITY OF NEAR-OPTIMAL GRAPH COLORING [J]. JOURNAL OF THE ACM, 1976, 23 (01) : 43 - 49