4.4 Article

When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks

Related references

Note: Only part of the references are listed.
Article Computer Science, Theory & Methods

A (1+ε)-EMBEDDING OF LOW HIGHWAY DIMENSION GRAPHS INTO BOUNDED TREEWIDTH GRAPHS

Andreas Emil Feldmann et al.

SIAM JOURNAL ON COMPUTING (2018)

Proceedings Paper Computer Science, Information Systems

When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest DistanceQu eries on Road Networks

Dian Ouyang et al.

SIGMOD'18: PROCEEDINGS OF THE 2018 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA (2018)

Article Computer Science, Hardware & Architecture

The exact distance to destination in undirected world

Lijun Chang et al.

VLDB JOURNAL (2012)

Article Computer Science, Artificial Intelligence

Query Processing Using Distance Oracles for Spatial Networks

Jagan Sankaranarayanan et al.

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2010)

Article Computer Science, Artificial Intelligence

An efficient path computation model for hierarchically structured topographical road maps

S Jung et al.

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2002)