Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization

Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai. Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. SIAM Journal on Computing, 45(3):947-1006, 2016. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.