An algorithm for tree-realizability of distance matricesFootnote^∗

^∗This paper was presented at the SIAM Conference on Discrete Mathematics in San Francisco. May 1988

References

• Boesch , F. T. 1968 . Properties of the distance matrix of a tree . Q. Appl. Math. , 26 : 607 – 609 .
   Google Scholar
• Culberson , J. C. and Rudnicki , P. 1989 . A fast algorithm for constructing trees from distance matrices . Information Processing Letters , 30 : 215 – 220 .
   Google Scholar
• Hakimi , S. L. and Yau , S. S. 1964–65 . Distance matrix of a graph and its realizability . Quart. Appl. Math. , 22 : 305 – 317 .
   Google Scholar
• Imrich , W. , Sim[otilde]es-Pereira , J. M. S. and Zamfirescu , C. M. 1984 . On optimal embeddings of metrics in graphs . J. Combin. Theory Ser. B , 36 : 1 – 15 .
   Google Scholar
• Sim[otilde]es-Pereira , J. M. S. 1969 . A. note on the tree realizability of a distance matrix . J. Combin. Theory , 6 : 303 – 310 .
   Google Scholar
• Sim[otilde]es-Pereira , J. M. S. 1984 . A note on optimal and suboptimal digraph realizations of quasidistance matrices . SIAM J. Algebraic and Discrete Methods , 5 : 117 – 132 .
   Google Scholar
• Sim[otilde]es-Pereira , J. M. S. 1987 . A note on distance matrices with unicyclic graph realizations . Discrete Math. , 65 : 277 – 287 .
   Google Scholar
• Sim[otilde]es-Pereira , J. M. S. and Zamfirescu , C. M. 1982 . Submatrices of nontree-realizable distance matrices . Linear Algebra Appl. , 44 : 1 – 17 .
   Google Scholar
• Zaretzkii , K. A. 1965 . Constructing a tree on the basis of a set of distances between the hanging vertices . Uspekhi Mat. Nauk. , 20 : 90 – 92 . in Russian
   Google Scholar