The Lee Path Connection Algorithm
From MaRDI portal
Publication:4042860
DOI10.1109/T-C.1974.224054zbMath0291.90071MaRDI QIDQ4042860
Publication date: 1974
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05)
Related Items (4)
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
