There Are Parallel and Dynamic Shortest-Path Algorithms for Sparse Graphs

Sairam Subramanian
Ph.D. thesis, Brown Univ., Computer Science Dept., 1995
Tech. report CS95-04, Brown Univ., Computer Science Dept., 1995
ftp://ftp.cs.brown.edu/pub/techreports/95/cs95-04.ps.Z

Cites:

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