The distance matrix of a graph and its tree realization

DOI10.1090/qam/414405zbMath0293.05103OpenAlexW106168664MaRDI QIDQ4044592

S. Louis Hakimi, A. N. Patrinos

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

Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)

Related Items (31)

A basic limitation on inferring phylogenies by pairwise sequence comparisons ⋮ Cyclic permutations and evolutionary trees ⋮ Reconstruction of graphs based on random walks ⋮ On optimal realizations of finite metric spaces by graphs ⋮ Weighted graphs with distances in given ranges ⋮ A constructive algorithm for realizing a distance matrix ⋮ A fast algorithm for constructing trees from distance matrices ⋮ A note on distance matrices with unicyclic graph realizations ⋮ On tight spans for directed distances ⋮ On graphlike \(k\)-dissimilarity vectors ⋮ A note on tree realizations of matrices ⋮ Trees, tight-spans and point configurations ⋮ Submatrices of non-tree-realizable distance matrices ⋮ Tree representations of non-symmetric group-valued proximities ⋮ Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem ⋮ A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices ⋮ Distance spectra of graphs: a survey ⋮ Invertibility of the TKF model of sequence evolution ⋮ Optimal shift coloring of trees ⋮ Free trees and bidirectional trees as representations of psychological distance ⋮ Composed degree-distance realizations of graphs ⋮ Composed degree-distance realizations of graphs ⋮ Unnamed Item ⋮ On some relations between 2-trees and tree metrics ⋮ On optimal embeddings of metrics in graphs ⋮ An Optimal Diagonal Tree Code ⋮ Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces ⋮ Linear time tree codes ⋮ Distance realization problems with applications to internet tomography ⋮ Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm ⋮ Relaxed and approximate graph realizations

This page was built for publication: The distance matrix of a graph and its tree realization