Abstract
The problem dealt with in this paper is the optimal ordering of mother boards of a vast digital system, for instance, so that the total length of the interconnecting wires will be minimal. It is shown that a directed and weighted linear graph may be produced, on which this problem is equivalent to the well-known problem of finding the shortest path between a unique source and a unique sink. An algorithm for tracing the shortest path is presented. This algorithm takes advantage of the special features of the auxiliary graph and reduces significantly the computational effort required. Some upper bounds on the number of operations needed are included.
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.
