Cargando…
Speeding Up Reachability Queries in Public Transport Networks Using Graph Partitioning
Computing path queries such as the shortest path in public transport networks is challenging because the path costs between nodes change over time. A reachability query from a node at a given start time on such a network retrieves all points of interest (POIs) that are reachable within a given cost...
| Autores principales: | , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8924103/ https://www.ncbi.nlm.nih.gov/pubmed/35310777 http://dx.doi.org/10.1007/s10796-021-10164-2 |