A constructive algorithm for realizing a distance matrix
From MaRDI portal
Publication:858334
DOI10.1016/j.ejor.2005.02.071zbMath1116.90092OpenAlexW2071595766MaRDI QIDQ858334
Publication date: 9 January 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/record/12739/files/Varone_constructive.pdf
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (9)
Reconstruction of graphs based on random walks ⋮ Vertex-weighted graphs: realizable and unrealizable domains ⋮ Injective optimal realizations of finite metric spaces ⋮ Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem ⋮ Distance spectra of graphs: a survey ⋮ Searching for realizations of finite metric spaces in tight spans ⋮ Composed degree-distance realizations of graphs ⋮ Composed degree-distance realizations of graphs ⋮ Relaxed and approximate graph realizations
Cites Work
- Counting dendrograms: A survey
- On optimal embeddings of metrics in graphs
- An algorithm and its role in the study of optimal graph 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
- Extended similarity trees
- On optimal realizations of finite metric spaces by graphs
- A fast algorithm for constructing trees from distance matrices
- A note on distance matrices with unicyclic graph realizations
- Distance matrix polynomials of trees
- Free trees and bidirectional trees as representations of psychological distance
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Trees related to realizations of distance matrices
- A note on the metric properties of trees
- A robust model for finding optimal evolutionary tree
- A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices
- Trees and Length Functions on Groups
- The Complexity of Metric Realization
- The distance matrix of a graph and its tree realization
- Tree Compatibility and Inferring Evolutionary History
- Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
- Determining the Evolutionary Tree Using Experiments
- Distance matrix of a graph and its realizability
- Properties of the distance matrix of a tree
- A note on the tree realizability of a distance matrix
- Minimizing phylogenetic number to find good evolutionary trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A constructive algorithm for realizing a distance matrix
