On optimal embeddings of metrics in graphs
- 1 February 1984
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 36 (1), 1-15
- https://doi.org/10.1016/0095-8956(84)90009-1
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance MatricesSIAM Journal on Algebraic Discrete Methods, 1984
- An Optimal Diagonal Tree CodeSIAM Journal on Algebraic Discrete Methods, 1983
- The Origin of Genetic InformationScientific American, 1981
- The theory and computation of evolutionary distances: Pattern recognitionJournal of Algorithms, 1980
- Diagonal tree codesInformation and Control, 1979
- A note on the metric properties of treesJournal of Combinatorial Theory, Series B, 1974
- The distance matrix of a graph and its tree realizationQuarterly of Applied Mathematics, 1972
- A note on the tree realizability of a distance matrixJournal of Combinatorial Theory, 1969
- Properties of the distance matrix of a treeQuarterly of Applied Mathematics, 1969
- Distance matrix of a graph and its realizabilityQuarterly of Applied Mathematics, 1965