A note on the tree realizability of a distance matrix
From MaRDI portal
Publication:5567012
DOI10.1016/S0021-9800(69)80092-XzbMath0177.26903MaRDI QIDQ5567012
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items (55)
On minimum spanning tree-like metric spaces ⋮ Distance-hereditary graphs ⋮ Families of multiweights and pseudostars ⋮ Cyclic permutations and evolutionary trees ⋮ Generating sparse spanners for weighted graphs ⋮ Underlying graph and total length of optimal realizations of variable distance matrices ⋮ On optimal realizations of finite metric spaces by graphs ⋮ Weighted graphs with distances in given ranges ⋮ A constructive algorithm for realizing a distance matrix ⋮ Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem ⋮ The additivity criterion for finite metric spaces and minimal fillings ⋮ An algorithm for tree-realizability of distance matrices∗ ⋮ A geometrical framework for \(f\)-statistics ⋮ A note on distance matrices with unicyclic graph realizations ⋮ Nodal distances for rooted phylogenetic trees ⋮ On the weights of simple paths in weighted complete graphs ⋮ Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves ⋮ On tight spans for directed distances ⋮ On graphlike \(k\)-dissimilarity vectors ⋮ The Four Point Condition: An Elementary Tropicalization of Ptolemy’s Inequality ⋮ Exact-2-relation graphs ⋮ A note on tree realizations of matrices ⋮ An algorithm and its role in the study of optimal graph realizations of distance matrices ⋮ On dissimilarity vectors of general weighted trees ⋮ Minimal Networks: A Review ⋮ Submatrices of non-tree-realizable distance matrices ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Tree representations of non-symmetric group-valued proximities ⋮ New bounds on the distance Laplacian and distance signless Laplacian spectral radii ⋮ Recovering normal networks from shortest inter-taxa distance information ⋮ A characterization of dissimilarity families of trees ⋮ A characterization of distance matrices of weighted cubic graphs and Peterson graphs ⋮ On sparse spanners of weighted graphs ⋮ A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices ⋮ Distance spectra of graphs: a survey ⋮ Reconstructing trees from subtree weights. ⋮ Representation of a tree with p hanging vertices by 2p-3 elements of its distance matrix ⋮ Reconstructing the shape of a tree from observed dissimilarity data ⋮ Graph theory ⋮ Distance matrices on the \textit{H-join} of graphs: a general result and applications ⋮ Composed degree-distance realizations of graphs ⋮ Composed degree-distance realizations of graphs ⋮ Unnamed Item ⋮ Recovering symbolically dated, rooted trees from symbolic ultrametrics ⋮ Treelike families of multiweights ⋮ Optimal imbeddings of metrics in graphs ⋮ From modular decomposition trees to rooted median graphs ⋮ Moduli space of families of positive \((n - 1)\)-weights ⋮ A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance ⋮ Trees related to realizations of distance matrices ⋮ A note on the metric properties of trees ⋮ On optimal embeddings of metrics in graphs ⋮ Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces ⋮ Distance realization problems with applications to internet tomography ⋮ On the consistency of the minimum evolution principle of phylogenetic inference
This page was built for publication: A note on the tree realizability of a distance matrix
