Optimal backboard ordering through the shortest path algorithm
- 1 September 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 21 (5) , 626-632
- https://doi.org/10.1109/tcs.1974.1083910
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Finding All Shortest Distances in a Directed NetworkIBM Journal of Research and Development, 1972
- Module Clustering to Minimize Delay in Digital NetworksIEEE Transactions on Computers, 1969
- A Decomposition Algorithm for Shortest Paths in a NetworkOperations Research, 1968
- General survey of design automation of digital computersProceedings of the IEEE, 1966
- An algorithm for placement of interconnected elements based on minimum wire lengthPublished by Association for Computing Machinery (ACM) ,1964
- Optimal and Suboptimal Algorithms for the Quadratic Assignment ProblemJournal of the Society for Industrial and Applied Mathematics, 1962
- An Algorithm for Path Connections and Its ApplicationsIEEE Transactions on Electronic Computers, 1961
- The Backboard Wiring Problem: A Placement AlgorithmSIAM Review, 1961
- Formal Procedures for Connecting Terminals with a Minimum Total Wire LengthJournal of the ACM, 1957