The distance matrix of a graph and its tree realization

DOI10.1090/QAM/414405MaRDI QIDQ4044592zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

Cited in

(31)

• Submatrices of non-tree-realizable distance matrices
• An Optimal Diagonal Tree Code
• 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
• scientific article; zbMATH DE number 6857397 (Why is no real title available?)
• 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
• Invertibility of the TKF model of sequence evolution
• Optimal shift coloring of trees
• Composed degree-distance realizations of graphs
• Composed degree-distance realizations of graphs
• 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

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)