A $K$-best paths algorithm for highly reliable communication networks

Shi-Wei Lee and Cheng-Shong Wu
IEICE Trans. Communications E82B(4):586–590, Apr 1999
http://citeseer.nj.nec.com/lee99kbest.html

Cites:

Finding the $k$ shortest paths

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine