4 citations · 5 across the 8 of their papers we have counts for
8 papers
Characterizing Block Graphs in Terms of their Vertex-Induced Partitions
A. Dress, K. T. Huber, J. Koolen +2
Given a finite connected simple graph with vertex set and edge set , we will show that the (necessarily unique) smallest block graph wit…
A matroid associated with a phylogenetic tree
Andreas Dress, Katharina Huber, Mike Steel
A (pseudo-)metric on a finite set is said to be a `tree metric' if there is a finite tree with leaf set and non-negative edge weights so that, for all , $D(x…
On Patchworks and Hierarchies
Andreas Dress, Vincent Moulton, Mike Steel +1
Motivated by questions in biological classification, we discuss some elementary combinatorial and computational properties of certain set systems that generalize hierarchies, namel…
`Lassoing' a phylogenetic tree I: Basic properties, shellings, and covers
A. W. M. Dress, K. T. Huber, M. Steel
A classical result, fundamental to evolutionary biology, states that an edge-weighted tree with leaf set , positive edge weights, and no vertices of degree 2 can be uniquely…
Blocks and Cut Vertices of the Buneman Graph
A. W. W. Dress, K. T. Huber, J. Koolen +1
Given a set $\Sg$ of bipartitions of some finite set of cardinality at least 2, one can associate to $\Sg$ a canonical -labeled graph $\B(\Sg)$, called the Buneman graph. Th…
An algorithm for computing cutpoints in finite metric spaces
A. Dress, K. T. Huber, J. Koolen +2
The theory of the tight span, a cell complex that can be associated to every metric , offers a unifying view on existing approaches for analyzing distance data, in particular fo…