An O(tm log D) Algorithm for shortest paths

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

An implementation of Dykstra's shortest paths algorithm is proposed, which requires O(m log D) computations in worst case, where m denotes the number of arcs and D the length of the longest arc of the graphs considered. To this effect, a data structure called binary counting tree is introduced. © 1980.

Cite

CITATION STYLE

APA

Hansen, P. (1980). An O(tm log D) Algorithm for shortest paths. Discrete Applied Mathematics, 2(2), 151–153. https://doi.org/10.1016/0166-218X(80)90004-9

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