Skip to main content
Conference Proceedings

An O(n 3 log log n/ log 2 n) time algorithm for all pairs shortest paths

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7357 LNCS 131-141
DOI: 10.1007/978-3-642-31155-0_12
30Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present an O(n 3 loglogn/log 2 n) time algorithm for all pairs shortest paths. This algorithm improves on the best previous result of O(n 3 (loglogn) 3/log 2 n ) time. © 2012 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Han, Y., & Takaoka, T. (2012). An O(n 3 log log n/ log 2 n) time algorithm for all pairs shortest paths. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7357 LNCS, pp. 131–141). https://doi.org/10.1007/978-3-642-31155-0_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free