268 search results - page 1 / 54 » Finding the k Shortest Paths |
FOCS
1994
IEEE
13 years 9 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 7 months ago
2003
STACS
1997
Springer
13 years 10 months ago
1997
Springer
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...
FOCS
1992
IEEE
13 years 10 months ago
1992
IEEE
Abstract Summary of results The subcubic (O(n ) for < 3) algorithms to multiply Boolean matrices do not provide the witnesses; namely, they compute C = AB but if Cij = 1 they d...