Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs

In this paper, we consider Dijkstra’s algorithm for the single source single target shortest paths problem in large sparse graphs. The goal is to reduce the response time for online queries by using precomputed information. For the result of the preprocessing, we admit at most linear space. We assum...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Wagner, Dorothea, Willhalm, Thomas
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Angular Sector Applied sciences Computer science control theory systems Exact sciences and technology Geometric Object Information retrieval. Graph Short Path Short Path Problem Short Path Tree Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!