3 papers
cs.DS2021
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…
cs.CC2020
Hierarchical Clusterings of Unweighted Graphs
Svein Høgemo, Christophe Paul, Jan Arne Telle
We study the complexity of finding an optimal hierarchical clustering of an unweighted similarity graph under the recently introduced Dasgupta objective function. We introduce a pr…
cs.DS2019
Linear MIM-Width of Trees
Svein Høgemo, Jan Arne Telle, Erlend Raa Vågset
We provide an algorithm computing the linear maximum induced matching width of a tree and an optimal layout.