A constructive algorithm for realizing a distance matrix
From MaRDI portal
Publication:858334
DOI10.1016/J.EJOR.2005.02.071zbMATH Open1116.90092OpenAlexW2071595766MaRDI QIDQ858334FDOQ858334
Authors: Sacha C. Varone 
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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Free trees and bidirectional trees as representations of psychological distance
- A note on the metric properties of trees
- A note on the tree realizability of a distance matrix
- A fast algorithm for constructing trees from distance matrices
- Distance matrix polynomials of trees
- A robust model for finding optimal evolutionary tree
- Counting dendrograms: A survey
- On optimal embeddings of metrics in graphs
- Trees related to realizations of distance matrices
- Title not available (Why is that?)
- Determining the Evolutionary Tree Using Experiments
- On optimal realizations of finite metric spaces by graphs
- Tree Compatibility and Inferring Evolutionary History
- The distance matrix of a graph and its tree realization
- Distance matrix of a graph and its realizability
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices
- The Complexity of Metric Realization
- Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
- Minimizing phylogenetic number to find good evolutionary trees
- Title not available (Why is that?)
- Trees and Length Functions on Groups
- Properties of the distance matrix of a tree
- An algorithm and its role in the study of optimal graph realizations of distance matrices
- Title not available (Why is that?)
- Extended similarity trees
- A note on distance matrices with unicyclic graph realizations
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (19)
- An algorithm for tree-realizability of distance matrices∗
- Underlying graph and total length of optimal realizations of variable distance matrices
- Realization of distance matrices by unicyclic graphs
- Title not available (Why is that?)
- Reconstruction of graphs based on random walks
- An algorithm and its role in the study of optimal graph realizations of distance matrices
- Relaxed and approximate graph realizations
- Injective optimal realizations of finite metric spaces
- Methods for constructing distance matrices and the inverse eigenvalue problem
- Searching for realizations of finite metric spaces in tight spans
- Distance realization problems with applications to internet tomography
- Distance spectra of graphs: a survey
- Graph realization of distance sets
- Modeling graphs using dot product representations
- Vertex-weighted graphs: realizable and unrealizable domains
- Composed degree-distance realizations of graphs
- Composed degree-distance realizations of graphs
- The Complexity of Metric Realization
- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
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)
