Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model

DOI10.1142/S0218195997000363zbMath0887.68078OpenAlexW2166490157MaRDI QIDQ4375872

No author found.

Publication date: 8 February 1998

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195997000363

zbMATH Keywords

shortest pathVLSI routingtwo-layer model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Finding shortest path in the presence of barriers: an alternate approach ⋮ An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model ⋮ Rectilinear paths among rectilinear obstacles

This page was built for publication: Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model