![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
An algorithm for testing tree realizability of distance matrices is given. It is well-known that if a matrix D has a realization by a tree then such a realization is optimal and unique up to homeomorphism. Our algorithm produces a tree realization or a message that there is no such realization in time O(n 2) where n is the number of points in a finite metric space with the distance matrix D. An O(n 2) algorithm for computing distance matrix for a given tree is also given.
∗This paper was presented at the SIAM Conference on Discrete Mathematics in San Francisco. May 1988
†Supported in part by the Reserch Conucil of Slovenia, Yugoslavia
∗This paper was presented at the SIAM Conference on Discrete Mathematics in San Francisco. May 1988
†Supported in part by the Reserch Conucil of Slovenia, Yugoslavia
Notes
∗This paper was presented at the SIAM Conference on Discrete Mathematics in San Francisco. May 1988
†Supported in part by the Reserch Conucil of Slovenia, Yugoslavia