Sciweavers

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

124

Voted

LATIN
2000
Springer

78views Information Technology» more LATIN 2000»

A Fully Dynamic Algorithm for Distributed Shortest Paths

15 years 6 months ago

A Fully Dynamic Algorithm for Distributed Shortest Paths

Download ing.univaq.it

Serafino Cicerone, Gabriele Di Stefano, Daniele Fr

Real-time Traffic

Information Management | LATIN 2000 |

claim paper

Related Content

» Fully Dynamic Algorithms for Maintaining Shortest Paths Trees

» A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs

» Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluat...

» Dynamic shortest paths and transitive closure Algorithmic techniques and data structures

» Partially Dynamic Concurrent Update of Distributed Shortest Paths

» The New Shortest Best Path Tree SBPT Algorithm for Dynamic Multicast Trees

» A new approach to dynamic all pairs shortest paths

» New dynamic programming algorithms for the resource constrained elementary shortest path p...

» Approximation Complexity of minmax Regret Versions of Shortest Path Spanning Tree and Knap...

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	LATIN
Authors	Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni

Comments (0)