Abstract
We present an algorithm which, given a tree-realizable distance matrix, constructs the tree in optimal O( n 2) time. For trees of bounded degree k, the algorithm runs in O( kn log k n) time, and for random trees it apparently runs in O( n) average time. We show how the algorithm can be used to test tree-realizability of a distance matrix.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
