1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees
Svein Høgemo
The graph invariant EPT-sum has cropped up in several unrelated fields in later years: As an objective function for hierarchical clustering, as a more fine-grained version of the c…
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…
Recognition of Linear and Star Variants of Leaf Powers is in P
Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle +1
A -leaf power of a tree is a graph whose vertices are the leaves of and whose edges connect pairs of leaves whose distance in is at most . A graph is a leaf p…
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.