TD-H2H: Shortest Path Query on Time-Dependent Graphs
A shortest path query on road networks is a fundamental problem, which has been studied widely. Existing studies usually model road networks as a static graph and query the path with the shortest distance between given vertices. However, a road network has time-dependent property, so modeling the ro...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Artigo |
| Langue: | Chinês |
| Publié: |
Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press
2023-05-01
|
| Collection: | Jisuanji kexue yu tansuo |
| Sujets: | |
| Accès en ligne: | http://fcst.ceaj.org/fileup/1673-9418/PDF/2111064.pdf |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|