The distance matrix of a graph and its tree realization
From MaRDI portal
Publication:4044592
DOI10.1090/QAM/414405zbMATH Open0293.05103OpenAlexW106168664MaRDI QIDQ4044592FDOQ4044592
Authors: A. N. Patrinos, S. Louis Hakimi
Publication date: 1972
Published in: Quarterly of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/qam/414405
Cited In (31)
- Free trees and bidirectional trees as representations of psychological distance
- Reconstruction of graphs based on random walks
- A basic limitation on inferring phylogenies by pairwise sequence comparisons
- Relaxed and approximate graph realizations
- On optimal embeddings of metrics in graphs
- On graphlike \(k\)-dissimilarity vectors
- Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm
- A fast algorithm for constructing trees from distance matrices
- A constructive algorithm for realizing a distance matrix
- On some relations between 2-trees and tree metrics
- A note on distance matrices with unicyclic graph realizations
- Title not available (Why is that?)
- Distance realization problems with applications to internet tomography
- Cyclic permutations and evolutionary trees
- Distance spectra of graphs: a survey
- On optimal realizations of finite metric spaces by graphs
- Weighted graphs with distances in given ranges
- A note on tree realizations of matrices
- On tight spans for directed distances
- Tree representations of non-symmetric group-valued proximities
- A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices
- Linear time tree codes
- Composed degree-distance realizations of graphs
- Composed degree-distance realizations of graphs
- Invertibility of the TKF model of sequence evolution
- Optimal shift coloring of trees
- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
- Trees, tight-spans and point configurations
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- An Optimal Diagonal Tree Code
- Submatrices of non-tree-realizable distance matrices
This page was built for publication: The distance matrix of a graph and its tree realization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044592)