A Configurable Shortest Path Algorithm for Three-Dimensional Grid Graphs with Applications to VLSI Multilayer Routing


Autoria(s): Tang, Maolin
Contribuinte(s)

Arabnia,

Data(s)

2002

Identificador

http://eprints.qut.edu.au/24461/

Publicador

CSREA Press

Relação

Tang, Maolin (2002) A Configurable Shortest Path Algorithm for Three-Dimensional Grid Graphs with Applications to VLSI Multilayer Routing. In Arabnia, (Ed.) Proceedings of the International Conference on VLSI (VLSI'02), 24-27 June 2002, Las Vegas, Nevada, USA.

Fonte

Faculty of Science and Technology

Tipo

Conference Paper