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:27 - 4 self

Documents Related by Co-Citation

117 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
838 A note on two problems in connection with graphs. Numerische Mathematik I – E Dijkstra - 1959
44 Updating Distances in Dynamic Graphs – S Even, H Gazit - 1985
579 Fibonacci heaps and their uses in improved network optimization problems – M Fredman, R E Tarjan - 1987
696 Heuristics: Intelligent Search Strategies for Computer Problem Solving – J Pearl - 1984
1156 Graph Theory – FRANK HARARY - 1969
1442 Network flows: Theory, algorithms and applications – R K Ahuja, T L Magnanti, J B Orlin - 1993
8668 Introduction to Algorithms – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001