The Lee Path Connection Algorithm

DOI10.1109/T-C.1974.224054MaRDI QIDQ4042860zbMATH OpenFDO

Authors F. Rubin

Publication date 1974

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Cited in

(5)

• Faster goal-oriented shortest path search for bulk and incremental detailed routing
• Percolation of the prolate ellipsoids of rotation in the continuum
• Faster goal-oriented shortest path search for bulk and incremental detailed routing
• Rectilinear paths among rectilinear obstacles
• A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing

This page was built for publication: The Lee Path Connection Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4042860)