28 citations · 80 across the 12 of their papers we have counts for
11 papers · 1 filter
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…
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…
The Split Decomposition of a k-Dissimilarity Map
Sven Herrmann, Vincent Moulton
A k-dissimilarity map on a finite set X is a function D : X \choose k \rightarrow R assigning a real value to each subset of X with cardinality k, k \geq 2. Such functions, also so…
Computing the bounded subcomplex of an unbounded polyhedron
Sven Herrmann, Michael Joswig, Marc E. Pfetsch
We study efficient combinatorial algorithms to produce the Hasse diagram of the poset of bounded faces of an unbounded polyhedron, given vertex-facet incidences. We also discuss th…