Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Dijkstra's algorithm

Known as: Dijkstra' algorithm, Dykstra's algorithm, Uniform-cost search 
Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
A common algorithm to solve the shortest path problem (SPP) is the Dijkstra algorithm. In this paper, a generalized Dijkstra… Expand
  • figure 2
  • figure 1
  • table 1
  • figure 3
  • figure 5
Highly Cited
2007
Highly Cited
2007
We study an acceleration method for point-to-point shortest-path computations in large and sparse directed graphs with given… Expand
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Highly Cited
2007
Highly Cited
2007
Abstract On a network with nonnegative-length edges, Dijkstra’s shortest path algorithm computes single-source shortest path in O… Expand
Highly Cited
2006
Highly Cited
2006
Dijkstra’s Algorithm is one of the most popular algorithms in computer science. It is also popular in operations research. It is… Expand
  • table 1
  • figure 1
  • table 2
  • table 5
  • figure 2
Highly Cited
2006
Highly Cited
2006
Motivated by applications to sensor, peer-to-peer, and ad hoc networks, we study distributed algorithms, also known as gossip… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
2003
Highly Cited
2003
The underlying principle of the algorithm may be described as follows: the algorithm starts with the source; it visits the… Expand
Highly Cited
1998
Highly Cited
1998
The single source shortest path (SSSP) problem lacks parallel solutions which are fast and simultaneously work-efficient. We… Expand
Highly Cited
1998
Highly Cited
1998
Let G(V, E) be a directed graph in which each vertex has a nonnegative weight. The cost of a path between two vertices in G is… Expand
Highly Cited
1986
Highly Cited
1986
We introduce an invariant of graphs called the tree-width, and use it to obtain a polynomially bounded algorithm to test if a… Expand
Highly Cited
1973
Highly Cited
1973
An assertion that Dijkstra's algorithm for shortest paths (adapted to allow arcs of negative weight) runs in <italic>O</italic… Expand