Skip to main content
Book Chapter

Fastest Path for a Single Departure-Time

  • Gunturi V
  • Shekhar S
Springer International Publishing, (2017), 25-41
DOI: 10.1007/978-3-319-67771-2_4
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter provides a gentle introduction to fastest path finding algorithms in spatio-temporal graphs. We first discuss a simple adaptation of the Dijkstra’s algorithm for finding the fastest path. Following this we cover more advanced concepts of A* and bi-directional search on temporal digraphs. The chapter also discusses adaptations of few of the centrality metrics for temporal digraphs.

Cite

CITATION STYLE

APA

Gunturi, V. M. V., & Shekhar, S. (2017). Fastest Path for a Single Departure-Time. In Spatio-Temporal Graph Data Analytics (pp. 25–41). Springer International Publishing. https://doi.org/10.1007/978-3-319-67771-2_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free