Shortest path problem

Known as: Singledestination shortest path problem, Shortest path routing, Single-destination shortest path problem 
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1962-2017
0500100019622017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1998
Highly Cited
1998
The shortest path (SP) problem in a network with nonnegative arc lengths can be solved easily by Dijkstra’s labeling algorithm in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh The grammar problem, a… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
The Restricted Shortest Path (RSP) problem, also known as the Delay-Constrained Least-Cost (DCLC) problem, is an NP-hard… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We consider a stochastic version of the classical shortest path problem whereby for each node of a graph, we must choose a… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the <italic>radix… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
We consider the problem of finding the shortest distance between all pairs of vertices in a complete digraph on n vertices, whose… (More)
Is this relevant?
Highly Cited
1980
Highly Cited
1980
In this paper we develop a Lagrangian relaxation algorithm for the problem of finding a shortest path between two nodes in a… (More)
  • figure 1
  • figure 2
  • table I
  • table 11
  • table 111
Is this relevant?
Highly Cited
1976
Highly Cited
1976
It is shown that O(N5/2) comparisons and additions suffice to solve the all-pairs shortest path problem for directed graphs on N… (More)
Is this relevant?