Exact Distance Oracles for Planar Graphs

A fast shortest-path query data structure may be of use whenever an application needs to compute shortest path distances between some but not all pairs of nodes. Indeed, shortest-path query processing is an integral part of many applications, in particular in Geographic Information Systems (GIS) and intelligent transportation systems. These systems may help individuals in finding fast routes or they may also assist companies in improving fleet management, plant and facility layout, and supply chain management.

Provided by: Massachusetts Institute of Technology Topic: Data Management Date Added: Apr 2011 Format: PDF

Find By Topic