Pages that link to "Item:Q1907943"
From MaRDI portal
The following pages link to Minimum spanning trees for tree metrics: Abridgements and adjustments (Q1907943):
Displaying 11 items.
- Tree reconstruction from triplet cover distances (Q405205) (← links)
- ``Minimax length links'' of a dissimilarity matrix and minimum spanning trees (Q676486) (← links)
- Approximating \(k\)-hop minimum spanning trees in Euclidean metrics (Q963410) (← links)
- Recovering symbolically dated, rooted trees from symbolic ultrametrics (Q1272801) (← links)
- On the extension of a partial metric to a tree metric (Q1422428) (← links)
- On some relations between 2-trees and tree metrics (Q1584450) (← links)
- Quasi-ultrametrics and their \(2\)-ball hypergraphs (Q1584458) (← links)
- \(l_\infty\)-approximation via subdominants. (Q1599172) (← links)
- On minimum spanning tree-like metric spaces (Q2357774) (← links)
- The triangles method to build \(X\)-trees from incomplete distance matrices (Q2773174) (← links)
- Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time (Q3575153) (← links)
