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)

(More)

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)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- G. Ramalingam, Thomas W. Reps
- J. Algorithms
- 1996

hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh The grammar problem, aâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- David Eppstein
- FOCS
- 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)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Refael Hassin
- Math. Oper. Res.
- 1992

The Restricted Shortest Path (RSP) problem, also known as the Delay-Constrained Least-Cost (DCLC) problem, is an NP-hardâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Noga Alon, Zvi Galil, Oded Margalit
- FOCS
- 1991

The upper bound on the exponent, Ï‰, of matrix multiplication over a ring that was three in 1968 has decreased several times andâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Dimitri P. Bertsekas, John N. Tsitsiklis
- Math. Oper. Res.
- 1991

We consider a stochastic version of the classical shortest path problem whereby for each node of a graph, we must choose aâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert E. Tarjan
- J. ACM
- 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

- Alan M. Frieze, Geoffrey R. Grimmett
- Discrete Applied Mathematics
- 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

- Gabriel Y. Handler, Israel Zang
- Networks
- 1980

In this paper we develop a Lagrangian relaxation algorithm for the problem of finding a shortest path between two nodes in aâ€¦Â (More)

Is this relevant?

Highly Cited

1976

Highly Cited

1976

- Michael L. Fredman
- SIAM J. Comput.
- 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?