A lazy version of Eppstein's $K$ shortest paths algorithm

Víctor Manuel Jiménez Pelayo and Andrés Marzal Varó
Proc. 2nd Int. Worksh. Experimental and Efficient Algorithms (WEA 2003), Lecture Notes in Computer Science 2647, Klaus Jansen, M. Margraf, M. Mastrolli, and José D. P. Rolim, ed., Springer-Verlag, 2003, pp. 179–190

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!