A note on tree realizations of matrices
RAIRO - Operations Research (2007)
- Volume: 41, Issue: 4, page 361-366
- ISSN: 0399-0559
Access Full Article
topAbstract
topHow to cite
topReferences
top- H.-J. Bandelt, Recognition of tree metrics. SIAM J. Algebr. Discrete Methods3 (1990) 1–6.
- J.-P. Barthélémy and A. Guénoche, Trees and proximity representations. John Wiley & Sons Ltd., Chichester (1991).
- P. Buneman, A note on metric properties of trees. J. Combin. Theory Ser. B17 (1974) 48–50.
- J.C. Culberson and P. Rudnicki, A fast algorithm for constructing trees from distance matrices. In Inf. Process. Lett.30 (1989) 215–220.
- M. Farach, S. Kannan and T. Warnow, A robust model for finding optimal evolutionary trees. Algorithmica13 (1995) 155–179.
- R.W. Floyd, Algorithm 97. Shortest path. Comm. ACM5 (1962) 345.
- S.L. Hakimi and S.S. Yau, Distance matrix of a graph and its realizability. Q. Appl. Math.22 (1964) 305–317.
- A.N. Patrinos and S.L. Hakimi, The distance matrix of a graph and its tree realization. Q. Appl. Math.30 (1972) 255–269.
- J.M.S. Simões-Pereira, A note on the tree realizability of a distance matrix. J. Combin. Theory6 (1969) 303–310.
- S.C. Varone, Trees related to realizations of distance matrices. Discrete Math.192 (1998) 337–346.