A Universal Scheme for Efficient Partitioned Shortest Path Index Construction, Querying, and Maintenance
The authors propose a universal scheme for designing efficient partitioned shortest path indexes that can be tailored for different network structures and application requirements, including index construction, querying, and maintenance.
