Characterization of the distance between subtrees of a tree by the associated tight span

DOI10.1007/s00026-006-0277-7zbMath1090.05018OpenAlexW2145159971MaRDI QIDQ2494462

Hiroshi Hirai

Publication date: 28 June 2006

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://cds.cern.ch/record/847769

zbMATH Keywords

four-point conditiontree metrics

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Distance in graphs (05C12)

Related Items (12)

An algorithm for finding a representation of a subtree distance ⋮ Bounds on the complexity of halfspace intersections when the bounded faces have small dimension ⋮ Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases ⋮ On tight spans for directed distances ⋮ On the facets of the secondary polytope ⋮ Geometry of Data ⋮ Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees ⋮ Trees, tight-spans and point configurations ⋮ Tree metrics and edge-disjoint \(S\)-paths ⋮ On duality and fractionality of multicommodity flows in directed networks ⋮ An Algorithm for Finding a Representation of a Subtree Distance ⋮ Tight spans of distances and the dual fractionality of undirected multiflow problems

This page was built for publication: Characterization of the distance between subtrees of a tree by the associated tight span