Finding the $k$ shortest paths in parallel

Eric Ruppert
Algorithmica 28(2):242–254, 2000
Proc. 14th Symp. Theoretical Aspects of Computer Science (STACS 1997), Lecture Notes in Computer Science 1200, Rüdiger K. Reischuk and Michel Morvan, ed., Springer-Verlag, 1997, pp. 475–486
http://link.springer-ny.com/link/service/journals/00453/contents/00/10038/

Cites:

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