Pages that link to "Item:Q2494462"
From MaRDI portal
The following pages link to Characterization of the distance between subtrees of a tree by the associated tight span (Q2494462):
Displayed 12 items.
- Trees, tight-spans and point configurations (Q442355) (← links)
- Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
- On the facets of the secondary polytope (Q618300) (← links)
- On duality and fractionality of multicommodity flows in directed networks (Q665994) (← links)
- Tight spans of distances and the dual fractionality of undirected multiflow problems (Q1044206) (← links)
- An algorithm for finding a representation of a subtree distance (Q1631632) (← links)
- Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases (Q1926641) (← links)
- On tight spans for directed distances (Q1928578) (← links)
- Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees (Q1942273) (← links)
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension (Q2391831) (← links)
- An Algorithm for Finding a Representation of a Subtree Distance (Q2835681) (← links)
- Geometry of Data (Q6061116) (← links)