Abstract
In this paper we present an algorithm for optimum realization of n × n distance matrix by a weighted digraph. The method has two major steps. In the first step the index pairs of the nonzero finite elements of the given matrix are partitioned such that the elements corresponding to each class have the same value. The second step involves a systematic graph construction process that uses the information from the first step and an algorithm for computing a distance matrix for a digraph. We have proved the correctness of our algorithm and shown that the optimum realization is unique. An example is presented for illustrating the algorithm.
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.
