Results 1  10
of
162,270
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
On shortest path representation
"... Abstract—Lately, it has been proposed to use shortest path first ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract—Lately, it has been proposed to use shortest path first
The Geodesic Shortest Path
"... Abstract. In the geodesic shortest path problem we have to find the shortest path between two points on the boundary of a polyhedron. The shortest path must lead along the surface of the polyhedron. In the article, the description and solution of that problem is given. The case with forbidden areas ..."
Abstract
 Add to MetaCart
Abstract. In the geodesic shortest path problem we have to find the shortest path between two points on the boundary of a polyhedron. The shortest path must lead along the surface of the polyhedron. In the article, the description and solution of that problem is given. The case with forbidden areas
On dynamic shortest paths problems
, 2004
"... We obtain the following results related to dynamic versions of the shortestpaths problem: (i) Reductions that show that the incremental and decremental singlesource shortestpaths problems, for weighted directed or undirected graphs, are, in a strong sense, at least as hard as the static allpairs ..."
Abstract

Cited by 40 (2 self)
 Add to MetaCart
We obtain the following results related to dynamic versions of the shortestpaths problem: (i) Reductions that show that the incremental and decremental singlesource shortestpaths problems, for weighted directed or undirected graphs, are, in a strong sense, at least as hard as the static all
Circular Shortest Path in Images
 Pattern Recognition
, 2003
"... Shortest path algorithms have been used in a number of applications such as crack detection, road or linear feature extraction in images. There are applications where the starting and ending positions of the shortest path need to be constrained. In this paper, we present several new algorithms for t ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
Shortest path algorithms have been used in a number of applications such as crack detection, road or linear feature extraction in images. There are applications where the starting and ending positions of the shortest path need to be constrained. In this paper, we present several new algorithms
Geometric Shortest Paths and Network Optimization
 Handbook of Computational Geometry
, 1998
"... Introduction A natural and wellstudied problem in algorithmic graph theory and network optimization is that of computing a "shortest path" between two nodes, s and t, in a graph whose edges have "weights" associated with them, and we consider the "length" of a path to ..."
Abstract

Cited by 187 (15 self)
 Add to MetaCart
Introduction A natural and wellstudied problem in algorithmic graph theory and network optimization is that of computing a "shortest path" between two nodes, s and t, in a graph whose edges have "weights" associated with them, and we consider the "length" of a path
On degree constrained shortest paths
 European Symposium on Algorithms (ESA
, 2005
"... Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a variant of the shortest path problem. The network has two kinds of edges, “actual ” edges and “potential ” edges. In ad ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a variant of the shortest path problem. The network has two kinds of edges, “actual ” edges and “potential ” edges
Results 1  10
of
162,270