A constructive algorithm for realizing a distance matrix
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3648765 (Why is no real title available?)
- scientific article; zbMATH DE number 1086909 (Why is no real title available?)
- scientific article; zbMATH DE number 1088265 (Why is no real title available?)
- scientific article; zbMATH DE number 1088266 (Why is no real title available?)
- scientific article; zbMATH DE number 1088267 (Why is no real title available?)
- scientific article; zbMATH DE number 871934 (Why is no real title available?)
- scientific article; zbMATH DE number 3243264 (Why is no real title available?)
- 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 metric properties of trees
- A note on the tree realizability of a distance matrix
- A robust model for finding optimal evolutionary tree
- An algorithm and its role in the study of optimal graph realizations of distance matrices
- Counting dendrograms: A survey
- Determining the Evolutionary Tree Using Experiments
- Distance matrix of a graph and its realizability
- Distance matrix polynomials of trees
- Extended similarity trees
- Free trees and bidirectional trees as representations of psychological distance
- Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
- Minimizing phylogenetic number to find good evolutionary trees
- On optimal embeddings of metrics in graphs
- On optimal realizations of finite metric spaces by graphs
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Properties of the distance matrix of a tree
- The Complexity of Metric Realization
- The distance matrix of a graph and its tree realization
- Tree Compatibility and Inferring Evolutionary History
- Trees and Length Functions on Groups
- Trees related to realizations of distance matrices
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
Cited in
(19)- Composed degree-distance realizations of graphs
- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
- Composed degree-distance realizations of graphs
- Searching for realizations of finite metric spaces in tight spans
- Relaxed and approximate graph realizations
- Injective optimal realizations of finite metric spaces
- Distance spectra of graphs: a survey
- The Complexity of Metric Realization
- Distance realization problems with applications to internet tomography
- Graph realization of distance sets
- An algorithm and its role in the study of optimal graph realizations of distance matrices
- An algorithm for tree-realizability of distance matrices∗
- Methods for constructing distance matrices and the inverse eigenvalue problem
- Underlying graph and total length of optimal realizations of variable distance matrices
- Realization of distance matrices by unicyclic graphs
- scientific article; zbMATH DE number 175988 (Why is no real title available?)
- Reconstruction of graphs based on random walks
- Modeling graphs using dot product representations
- Vertex-weighted graphs: realizable and unrealizable domains
This page was built for publication: A constructive algorithm for realizing a distance matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858334)
