On Dasgupta's hierarchical clustering objective and its relation to other graph parameters

Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes +2

The minimum height of vertex and edge partition trees are well-studied graph parameters known as, for instance, vertex and edge ranking number. While they are NP-hard to determine…