Parallel computation of best connections in public transportation networks.

Daniel Delling Bastian Katz Thomas Pajor

Published in: ACM J. Exp. Algorithmics (2012)

Keyphrases

parallel computation
transportation networks
parallel algorithm
travel time
road network
parallel processing
parallel implementation
parallel computing
traveling salesman problem
parallel programming
travel cost
image sequences
lower bound
dynamic programming