Abstract
In this paper, we study a distance defined over the partitions of a finite set. Given two partitions P and Q, this distance is defined as the minimum number of transfers of an element from one class to another, required to transform P into Q. We recall the algorithm to evaluate this distance and we give some formulae for the maximum distance value between two partitions having exactly or at most p and q classes, for given p and q.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Charon, I., Denoeud, L., Guenoche, A. et al. Maximum Transfer Distance Between Partitions. Journal of Classification 23, 103–121 (2006). https://doi.org/10.1007/s00357-006-0006-2
Issue Date:
DOI: https://doi.org/10.1007/s00357-006-0006-2