Multiple-source shortest paths in planar graphs

Philip N. Klein
Proc. 16th Symp. Discrete Algorithms, ACM and SIAM, Jan 2005, pp. 146–155

Cites:

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