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:
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: