Arc-flags in dynamic graphs

OpenAccess Series in Informatics

Volumn 12, Issue , 2009, Pages

  Berrettini, Emanuele ^a   D'Angelo, Gianlorenzo ^a   Delling, Daniel ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Dynamic graph algorithm; Shortest path; Speed up technique

Indexed keywords

DYNAMIC GRAPH; DYNAMIC GRAPH ALGORITHMS; DYNAMIC SCENARIOS; EDGE WEIGHTS; QUICKEST PATHS; ROUTE PLANNING; SHORTEST PATH; SPEED-UP TECHNIQUES;

OPTIMIZATION;

ALGORITHMS;

EID: 84883011757     PISSN: 21906807     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. D. Delling. Engineering and Augmenting Route Planning Algorithms. PhD thesis, Universität Karlsruhe (TH), Fakultät für Informatik, 2009.
2. D. Delling and G. Nannicini. Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks. In S.-H. Hong, H. Nagamochi, and T. Fukunaga, editors, Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC'08), volume 5369 of Lecture Notes in Computer Science, pages 813-824. Springer, December 2008.
3. D. Delling, P. Sanders, D. Schultes, and D. Wagner. Engineering Route Planning Algorithms. In J. Lerner, D. Wagner, and K. A. Zweig, editors, Algorithmics of Large and Complex Networks, volume 5515 of Lecture Notes in Computer Science, pages 117-139. Springer, 2009.
4. D. Delling and D. Wagner. Landmark-Based Routing in Dynamic Graphs. In Demetrescu [5], pages 52-65.
5. C. Demetrescu, editor. Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07), volume 4525 of Lecture Notes in Computer Science. Springer, June 2007.
6. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
7. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Fully dynamic algorithms for maintaining shortest paths trees. Journal of Algorithms, 34(2):251-281, 2000.
8. * Search Meets Graph Theory. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'05), pages 156-165, 2005.
9. M. Hilger, E. Köhler, R. H. Möhring, and H. Schilling. Fast Point-to-Point Shortest Path Computations with Arc-Flags. In C. Demetrescu, A. V. Goldberg, and D. S. Johnson, editors, Shortest Path Computations: Ninth DIMACS Challenge, volume 24 of DIMACS Book. American Mathematical Society, 2009. To appear.
10. U. Lauther. Slow preprocessing of graphs for extremely fast shortest path calculations. In Workshop on Computational Integer Programming at ZIB, 1997.
11. U. Lauther. An extremely fast, exact algorithm for finding shortest paths. Static Networks with Geographical Background, 22:219-230, 2004.
12. P. Sanders and D. Schultes. Engineering Highway Hierarchies. In Proceedings of the 14th Annual European Symposium on Algorithms (ESA'06), volume 4168 of Lecture Notes in Computer Science, pages 804-816. Springer, 2006.
13. D. Schultes and P. Sanders. Dynamic Highway-Node Routing. In Demetrescu [5], pages 66-79.
14. F. Schulz, D. Wagner, and C. Zaroliagis. Using Multi-Level Graphs for Timetable Information in Railway Systems. In Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX'02), volume 2409 of Lecture Notes in Computer Science, pages 43-59. Springer, 2002.
15. D. Wagner and T. Willhalm. Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. In Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03), volume 2832 of Lecture Notes in Computer Science, pages 776-787. Springer, 2003.
16. D. Wagner, T. Willhalm, and C. Zaroliagis. Geometric Containers for Efficient Shortest-Path Computation. ACM Journal of Experimental Algorithmics, 10:1.3, 2005.