Formal Procedures for Connecting Terminals with a Minimum Total Wire Length
- 1 October 1957
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 4 (4), 428-437
- https://doi.org/10.1145/320893.320896
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956