Architecture-intact oracle for fastest path and time queries on dynamic spatial networks

Given two vertices of interest (POIs) s and t on a spatial network, a distance (path) query returns the shortest network distance (shortest path) from s to t. This query has a variety of applications in practice and is a fundamental operation for many database and data mining algorithms. In this pap...

Full description

Saved in:
Bibliographic Details
Main Authors: Wei, Victor Junqiu, Wong, Raymond Chi-Wing, Long, Cheng
Other Authors: School of Computer Science and Engineering
Format: Conference or Workshop Item
Language:English
Published: 2021
Subjects:
Online Access:https://hdl.handle.net/10356/148161
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Be the first to leave a comment!
You must be logged in first