Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract) (0)

Cached

Download Links

by Daniele Frigioni , Alberto Marchetti-spaccamela , Umberto Nanni
Venue:In ACM-SIAM Symposium on Discrete Algorithms
Citations:24 - 4 self

Documents Related by Co-Citation

116 An Incremental Algorithm for a Generalization of the Shortest-Path Problem – G. Ramalingam, Thomas Reps - 1992
65 Incremental Algorithms for Minimal Length Paths – G Ausiello, G F Italiano, A Marchetti-Spaccamela, U Nanni - 1990
44 Updating Distances in Dynamic Graphs – S Even, H Gazit - 1985
22 Semi-dynamic Algorithms for Maintaining Single-Source Shortest Path Trees – Daniele Frigioni, Alberto Marchetti-spaccamela, Umberto Nanni
22 A Dynamization of the All Pairs Least Cost Path Problem – H Rohnert - 1985
819 A note on two problems in connection with graphs – E W Dijkstra - 1959
64 Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs – Valerie King - 1999
32 Finding paths and deleting edges in directed acyclic graphs – G F Italiano - 1988
51 On the Computational Complexity of Dynamic Graph Problems – G. Ramalingam, Thomas Reps - 1996
14 Dynamic algorithms for shortest paths in planar graphs – E Feuerstein, A Marchetti-Spaccamela - 1993
39 On finding and updating spanning trees and shortest paths – P. M. Spira, A. Pan - 1975
122 A.: Sparsification—a technique for speeding up dynamic graph algorithms – D Eppstein, Z Galil, G F Italiano, Nissenzweig - 1997
19 Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem – Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone - 1997
48 Fully dynamic algorithms for maintaining shortest paths trees – D Frigioni, A Marchetti-Spaccamela, U Nanni
54 New Dynamic Algorithms for Shortest Path Tree Computation – Paolo Narváez, Kai-Yeung Siu, Hong-yi Tzeng - 2000
24 An Empirical Study of Dynamic Graph Algorithms – David Alberts, Giuseppe Cattaneo, Giuseppe F. Italiano - 1996
47 Randomized Dynamic Graph ALgorithms with Polylogarithmic Time per Operation – Monika Rauch Henzinger, Valerie King - 1995
69 A New Approach to Dynamic All Pairs Shortest Paths – Camil Demetrescu, Giuseppe F. Italiano - 2002
571 Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms – M L Fredman, R E - 1987