Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

76

Voted

COR
1999

64views more COR 1999»

Parallel algorithms for solving aggregated shortest-path problems

15 years 2 months ago

Parallel algorithms for solving aggregated shortest-path problems

Download www-personal.umich.edu

H. Edwin Romeijn, Robert L. Smith

Real-time Traffic

COR 1999 |

claim paper

Related Content

» Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons

» NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Pa...

» Program generation for the allpairs shortest path problem

» Advanced Shortest Paths Algorithms on a MassivelyMultithreaded Architecture

» Experimental Studies of Symbolic ShortestPath Algorithms

» HardwareSoftware Integration for FPGAbased AllPairs ShortestPaths

» Rubberband Algorithms for Solving Various 2D or 3D Shortest Path Problems

» A multisource labelcorrecting algorithm for the allpairs shortest paths problem

» On Degree Constrained Shortest Paths

» Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	COR
Authors	H. Edwin Romeijn, Robert L. Smith

Comments (0)