ScholarLens Back to search
1983•Society for Industrial and Applied Mathematics eBooksRequires access

7. Shortest Paths

Robert Endre Tarjan

Open publisher page 4 citations

Abstract

7.1. Shortest-path trees and labeling and scanning. Another important network optimization problem is that of finding shortest paths. Let G be a directed graph whose edges have real-valued (possibly negative) lengths. We shall denote the length of an edge [v, w] by length (v, w). The length of a path p, denoted by length (p), is the sum of the lengths of the edges on p. A shortest path from a vertex s to a vertex t is a path from s to t whose length is minimum. The shortest-path problem is to find a shortest path from s to t for each member [s, t] of a given collection of vertex pairs. The paper of Dreyfus [7] is a good survey of early work on this problem. We shall consider four versions of the problem:

About this research paper

What this paper is about

7.1. Shortest-path trees and labeling and scanning. Another important network optimization problem is that of finding shortest paths. Let G be a directed graph whose edges have real-valued (possibly negative) lengths. We shall denote the length of an edge [v, w] by length (v, w). The length of a path p, denoted by length (p), is the sum of the lengths of the edges on p. A shortest path from a vertex s to a vertex t is a path from s to t whose length is minimum. The shortest-path problem is to find a shortest path from s to t for each member [s, t] of a given collection of vertex pairs. The paper of Dreyfus [7] is a good survey of early work on this problem. We shall consider four versions of the problem:

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

7.1. Shortest-path trees and labeling and scanning. Another important network optimization problem is that of finding shortest paths. Let G be a directed graph whose edges have real-valued (possibly negative) lengths. We shall denote the length of an edge [v, w] by length (v, w). The length of a path p, denoted by length (p), is the sum of the lengths of the edges on p. A shortest path from a vertex s to a vertex t is a path from s to t whose length is minimum. The shortest-path problem is to find a shortest path from s to t for each member [s, t] of a given collection of vertex pairs. The paper of Dreyfus [7] is a good survey of early work on this problem. We shall consider four versions of the problem:

Key concepts: Shortest path problem, Combinatorics, Distance, Vertex (graph theory), Mathematics, Longest path problem, Widest path problem, Shortest-path tree

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
7. Shortest Paths — Research Paper | ScholarLens