A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices
- 1 March 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 5 (1), 117-132
- https://doi.org/10.1137/0605014
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- The structure of distances in networksNetworks, 1986
- On optimal embeddings of metrics in graphsJournal of Combinatorial Theory, Series B, 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
- Properties of the distance matrix of a treeQuarterly of Applied Mathematics, 1969
- Distance matrix of a graph and its realizabilityQuarterly of Applied Mathematics, 1965