Suppression distance computation for hierarchical clusterings
We generalize the suppression distance defined for partitions to hierarchical clusterings. We reduce its computation to the minimum vertex cover problem. We prove this problem can be solved in polynomial time and provide a recursive algorithm.
distance clustering algorithms hierarchical partition graphs