A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs.

Sairam Sairam Roberto Tamassia Jeffrey Scott Vitter

Published in: SPDP (1992)

Keyphrases

shortest path
shortest path problem
road network
shortest path algorithm
routing algorithm
directed graph
optimal path
minimum cost flow
geodesic distance
path length
shortest distance
flow graph
travel time
strongly connected components
finding the shortest path
social networks
minimal surface
objective function