Optimization realization of a distance matrix Footnote†

†This research was completely supported by Deapartment of Computer Science and Engineering, School of Engineering, Shiraz University Shiraz, Iran.

References

• Hakimi , S.L. and Yau , S.S. 1965 . Distance matrix of a graph and its realizability . Quart. Appl.Math , 12 : 305 – 317 .
   Google Scholar
• Patrinos A.N. Hakimi S.L. The distance matrix of a graph and its tree realization Quart Appl. Math. 1972 255 269
   Google Scholar
• Goldman , A.J. 1966 . Realizing the distance matrix of a graph . J. Res. Nat Bur. Standards , B70 : 153 – 154 .
   Google Scholar
• Boesch , F.T. 1969 . Properties of the distance matrix of a tree . Quart, Appl. Math , 16 : 607 – 609 .
   Google Scholar
• Hu , T.C. 1974 . Optimum communication spanning trees . SIAM J. Comput , 3 ( 3 ) : 188 – 195 .
   Google Scholar
• Floyd , R.W. 1962 . Algorithm 97: Shortest path . Comm. ACM , 5 ( 3 ) : 345
   Google Scholar
• Minieka , E. 1974 . On computing sets of shortest paths in a graph . Comm. ACM , 17 ( 6 ) : 351 – 353 .
   Web of Science ®Google Scholar
• Harary , F. 1969 . Graph Theory , Reading, Mass : Addison-Wesley .
   Google Scholar