An algorithm for tree-realizability of distance matrices∗
From MaRDI portal
Recommendations
- A fast algorithm for constructing trees from distance matrices
- An algorithm and its role in the study of optimal graph realizations of distance matrices
- Trees related to realizations of distance matrices
- scientific article; zbMATH DE number 3853121
- A constructive algorithm for realizing a distance matrix
Cites work
- A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices
- A fast algorithm for constructing trees from distance matrices
- A note on distance matrices with unicyclic graph realizations
- A note on the tree realizability of a distance matrix
- On optimal embeddings of metrics in graphs
- Submatrices of non-tree-realizable distance matrices
Cited in
(15)- scientific article; zbMATH DE number 3853121 (Why is no real title available?)
- scientific article; zbMATH DE number 1222844 (Why is no real title available?)
- An algorithm and its role in the study of optimal graph realizations of distance matrices
- On the longest path algorithm for reconstructing trees from distance matrices
- An Almost Linear-Time Algorithm for Graph Realization
- A fast algorithm for constructing trees from distance matrices
- An algorithm for finding a representation of a subtree distance
- \(l_\infty\)-approximation via subdominants.
- An algorithm for finding a representation of a subtree distance
- A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem
- Trees related to realizations of distance matrices
- Comparing resemblance measures
- Nodal distances for rooted phylogenetic trees
- A note on tree realizations of matrices
- Recognizing and realizing cactus metrics
This page was built for publication: An algorithm for tree-realizability of distance matrices∗
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3477951)
