One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
Open Accesshttps://doi.org/10.1016/j.jda.2016.09.001
Copy DOI
Export
Save
Share
Cite Journal: Journal of Discrete Algorithms |  Publication Date: May 1, 2016 |
 Citations: 16 |  License type: elsevier-specific: oa user license |
Affiliation: University of Missouri–Kansas City, University of Canterbury
We present an O(n3loglogn/log2n) time algorithm for all pairs shortest paths. This algorithm improves on the best previous result of O(n3(loglogn)3/log2n) time.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
