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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1966-2017
010020019662017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
A common algorithm to solve the shortest path problem (SPP) is the Dijkstra algorithm. In this paper, a generalized Dijkstra… (More)
  • figure 2
  • figure 1
  • table 1
  • figure 3
  • figure 5
Is this relevant?
2011
2011
Dijkstra’s single-source shortest-path algorithm (DA) is one of the well-known, fundamental algorithms in computer science and… (More)
  • figure 1
  • table 1
Is this relevant?
2010
2010
In order to improve the efficiency of road network route planning,many experts and scholars have conducted some studies, Dijkstra… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2006
2006
We construct a readable, compact and efficient implementation of Dijkstra’s shortest path algorithm and Fibonacci heaps using… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We study an acceleration method for point-to-point shortest-path computations in large and sparse directed graphs with given… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The image foresting transform (IFT) is a graph-based approach to the design of image processing operators based on connectivity… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
The power quality service is necessary demand in near future of the customer's. The fast service restoration has been a hot issue… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Traffic information systems are among the most prominent real-world applications of Dijkstra's algorithm for shortest paths. We… (More)
Is this relevant?
1996
1996
This paper discusses the implementation of Dijkstra’s classic double bucket algorithm for path finding in connected networks. The… (More)
  • table 3
  • table 1
  • figure 1
  • table 2
  • figure 3
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We present serial and parallel algorithms for solving a system of equations that arises from the discretization of the Hamilton… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?