This Article 
 Bibliographic References 
 Add to: 
November 1972 (vol. 21 no. 11)
pp. 1227-1233
L.C. Abel, Digital Equipment Corporation
Most wire-routing programs utilize a maze-running technique to route one connection at a time. Once routed, a wire cannot be moved even if it is subsequently discovered to interfere with the successful completion of other connections. The order in which the desired connections are presented to the routing algorithm has therefore been thought to be of critical importance. Experimental evidence is presented, however, to show that the performance of a router, when measured in terms of the total of the minimum (or ideal) lengths of the connections successfully completed, is, in fact, independent of the order in which connections are attempted.
Index Terms:
Computer-aided design, computer design automation, connection routing, interconnection, printed circuit, wiring.
L.C. Abel, "On the Ordering of Connections for Automatic Wire Routing," IEEE Transactions on Computers, vol. 21, no. 11, pp. 1227-1233, Nov. 1972, doi:10.1109/T-C.1972.223482
Usage of this product signifies your acceptance of the Terms of Use.