Sciweavers

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

28

JEA
2006

favoriteEmaildiscussreport

208views more JEA 2006»

Partitioning graphs to speedup Dijkstra's algorithm

13 years 11 months ago

Partitioning graphs to speedup Dijkstra's algorithm

Download www.cs.uwaterloo.ca

Rolf H. Möhring, Heiko Schilling, Birk Sch&uu

Real-time Traffic

JEA 2006 |

claim paper

Related Content

» Combining hierarchical and goaldirected speedup techniques for dijkstras algorithm

» Employing Transactional Memory and Helper Threads to Speedup Dijkstras Algorithm

» Partitioning Graphs to Speed Up Dijkstras Algorithm

» The Shortcut Problem Complexity and Approximation

» Dynamic Multilevel Overlay Graphs for Shortest Paths

» A Parallel Distance2 Graph Coloring Algorithm for Distributed Memory Computers

» Maintenance of Multilevel Overlay Graphs for Timetable Queries

» Exploiting PseudoSchedules to Guide Data Dependence Graph Partitioning

» Parallelizing postplacement timing optimization

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JEA
Authors	Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm

Comments (0)