Characterization of the distance between subtrees of a tree by the associated tight span
From MaRDI portal
Publication:2494462
Recommendations
- Distance preserving subtrees in minimum average distance spanning trees
- Metric stability of trees and tight spans
- On subbetweennesses of trees: hardness, algorithms, and characterizations
- Distance approximating spanning trees
- On the distance spectrum of trees
- scientific article; zbMATH DE number 7651097
- On the distance spectral radius of trees
- A note on distance approximating trees in graphs
- Distance approximating trees in graphs
- An algorithm for finding a representation of a subtree distance
Cited in
(16)- Tight spans of distances and the dual fractionality of undirected multiflow problems
- An algorithm for finding a representation of a subtree distance
- Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
- On tight spans for directed distances
- Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
- An algorithm for finding a representation of a subtree distance
- Metric stability of trees and tight spans
- Trees, tight-spans and point configurations
- Tree metrics and edge-disjoint \(S\)-paths
- Geometry of Data
- On the facets of the secondary polytope
- On duality and fractionality of multicommodity flows in directed networks
- Subtree distances, tight spans and diversities
- Buneman graphs, partial splits and subtree distances
- Enhanced negative type for finite metric trees
This page was built for publication: Characterization of the distance between subtrees of a tree by the associated tight span
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494462)
