Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

FOCS
1994
IEEE

favoriteEmaildiscussreport

98views Theoretical Computer Science» more FOCS 1994»

Finding the k Shortest Paths

13 years 7 months ago

Finding the k Shortest Paths

Download www.ics.uci.edu

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 paths as an unordered set in time O(m + n log n + k). The paths can be output in order by length in total time O(m + n log n + k log k). We can also find the k paths from a given source s to each vertex in the graph, in total time O(m + n log n + kn). Work supported in part by NSF grant CCR-9258355.

David Eppstein

Real-time Traffic

FOCS 1994 | Implicit Representation | Shortest Paths | Theoretical Computer Science | Total Time |

claim paper

Related Content

» Finding the k Shortest Simple Paths A New Algorithm and Its Implementation

» Finding the k Shortest Paths in Parallel

» Computing homotopic shortest paths efficiently

» Witnesses for Boolean Matrix Multiplication and for Shortest Paths

» The ShortestPath Problem with Resource Constraints and kCycle Elimination for k 3

» Monitoring path nearest neighbor in road networks

» Surface kNN Query Processing

» Finding Sparser Directed Spanners

» Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1994
Where	FOCS
Authors	David Eppstein

Comments (0)