32 search results - page 1 / 7 » Finding the k Shortest Paths in Parallel |
STACS
1997
Springer
13 years 11 months ago
1997
Springer
FOCS
1994
IEEE
13 years 10 months ago
1994
IEEE
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...
ALENEX
2003
13 years 8 months ago
2003
ICPP
2009
IEEE
14 years 1 months ago
2009
IEEE
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according...
COMGEO
2006
ACM
13 years 6 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...