On the difficulty of some shortest path problems

John E. Hershberger, Subhash Suri, and Amit M. Bhosle
Proc. 20th Symp. Theoretical Aspects of Computer Science (STACS 2003), Lecture Notes in Computer Science 2607, Helmut Alt and Michel Habib, ed., Springer-Verlag, 2003, pp. 343–354
http://www.cs.ucsb.edu/~bhosle/publications/stacs03.pdf

Cites:

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