Trees, tight-spans and point configurations

DOI10.1016/j.disc.2012.05.003zbMath1301.54042arXiv1104.1538OpenAlexW1971754301MaRDI QIDQ442355

Sven Herrmann, Vincent L. Moulton

Publication date: 10 August 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1104.1538

zbMATH Keywords

metricdiversityinjective hulldirected distancepoint configurationpolytopal subdivisiontight-span

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) (n)-dimensional polytopes (52B11) Metric spaces, metrizability (54E35) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Related Items (4)

Quasi-metric tree in \(T_0\)-quasi-metric spaces ⋮ On tight spans for directed distances ⋮ Quasi-metric trees and $q$-hyperconvex hulls ⋮ The Buneman index via polyhedral split decomposition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for computing cutpoints in finite metric spaces
• The split decomposition of a \(k\)-dissimilarity map
• On the facets of the secondary polytope
• Triangulations. Structures for algorithms and applications
• Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
• A canonical decomposition theory for metrics on a finite set
• Hyperconvexity and tight-span theory for diversities
• Tropical convexity
• Classification of six-point metrics
• \(T\)-theory: An overview
• On tight spans for directed distances
• Tree representations of non-symmetric group-valued proximities
• Hereditarily optimal realizations of consistent metrics
• Characterization of the distance between subtrees of a tree by the associated tight span
• A geometric study of the split decomposition
• Six theorems about injective metric spaces
• Basic Phylogenetic Combinatorics
• Splitting Polytopes
• A New Approach to the Server Problem
• The distance matrix of a graph and its tree realization
• Generosity Helps or an 11-Competitive Algorithm for Three Servers

This page was built for publication: Trees, tight-spans and point configurations