A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing

From MaRDI portal
Publication:1044022

DOI10.1016/j.jda.2007.08.003zbMath1176.90612OpenAlexW2082473446MaRDI QIDQ1044022

Dieter Rautenbach, Jens Vygen, Sven Peyer

Publication date: 10 December 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2007.08.003




Related Items



Cites Work


This page was built for publication: A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing