Sciweavers

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

138

Voted

WEA
2005
Springer

294views Algorithms» more WEA 2005»

Partitioning Graphs to Speed Up Dijkstra's Algorithm

15 years 10 months ago

Partitioning Graphs to Speed Up Dijkstra's Algorithm

Download www.math.tu-berlin.de

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

Real-time Traffic

Algorithms | WEA 2005 |

claim paper

Related Content

» Clique Partitions Graph Compression and SpeedingUp Algorithms

» Speeding up Parallel Graph Coloring

» Partitioning graphs to speedup Dijkstras algorithm

» Using Bloom Filters to Speed Up HITSLike Ranking Algorithms

» Speeding up algorithms on compressed web graphs

» Using Local Search to Speed Up Filtering Algorithms for Some NPHard Constraints

» The DivideandConquer SubgoalOrdering Algorithm for Speeding up Logic Inference

» An Approach to Graph and Netlist Compression

» Speeding up Slicing

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	WEA
Authors	Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm

Comments (0)