Algorithms for shortest paths and $d$-cycle problems

Sergei N. Bespamyatnikh and Andrei Kelarev
Proc. 10th Australian Worksh. Combinatorial Algorithms, 1999, pp. 152–156
J. Discrete Algorithms 1(1):1–9, Feb 2003

Cites:

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