28 citations · 80 across the 12 of their papers we have counts for
13 papers
Recognizing Treelike k-Dissimilarities
Sven Herrmann, Katharina T. Huber, Vincent Moulton +1
A k-dissimilarity D on a finite set X, |X| >= k, is a map from the set of size k subsets of X to the real numbers. Such maps naturally arise from edge-weighted trees T with leaf-se…
Computing the blocks of a quasi-median graph
Sven Herrmann, Vincent Moulton
Quasi-median graphs are a tool commonly used by evolutionary biologists to visualise the evolution of molecular sequences. As with any graph, a quasi-median graph can contain cut v…
Searching for Realizations of Finite Metric Spaces in Tight Spans
Sven Herrmann, Vincent Moulton, Andreas Spillner
An important problem that commonly arises in areas such as internet traffic-flow analysis, phylogenetics and electrical circuit design, is to find a representation of any given met…
Dressians, Tropical Grassmannians, and Their Rays
Sven Herrmann, Michael Joswig, David Speyer
The Dressian Dr(k,n) parametrizes all tropical linear spaces, and it carries a natural fan structure as a subfan of the secondaryfan of the hypersimplex Δ(k,n). We explore the comb…
Optimal realisations of two-dimensional, totally-decomposable metrics
Sven Herrmann, Jack Koolen, Alice Lesser +2
A realisation of a metric on a finite set is a weighted graph whose vertex set contains such that the shortest-path distance between elements of considered…
Trees, Tight-Spans and Point Configuration
Sven Herrmann, Vincent Moulton
Tight-spans of metrics were first introduced by Isbell in 1964 and rediscovered and studied by others, most notably by Dress, who gave them this name. Subsequently, it was found th…