The complexity of computing metric distances between partitions
- 1 May 1981
- journal article
- Published by Elsevier in Mathematical Social Sciences
- Vol. 1 (3) , 269-287
- https://doi.org/10.1016/0165-4896(81)90042-1
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Validity of clusters formed by graph-theoretic cluster methodsMathematical Biosciences, 1977
- Methods of Comparing ClassificationsAnnual Review of Ecology and Systematics, 1974
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Multidimensional scaling of measures of distance between partitionsJournal of Mathematical Psychology, 1973
- Metrics on spaces of finite treesJournal of Mathematical Psychology, 1973
- Objective Criteria for the Evaluation of Clustering MethodsJournal of the American Statistical Association, 1971
- A Metric and an Ordering on SetsPsychometrika, 1959
- Variants of the hungarian method for assignment problemsNaval Research Logistics Quarterly, 1956
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955
- Theory of equivalence relationsDuke Mathematical Journal, 1942