On the Computational Complexity of Dynamic Graph Problems (1996)

Cached

Download Links

by G. Ramalingam , Thomas Reps
Venue:THEORETICAL COMPUTER SCIENCE
Citations:52 - 1 self

Documents Related by Co-Citation

116 An Incremental Algorithm for a Generalization of the Shortest-Path Problem – G. Ramalingam, Thomas Reps - 1992
68 Incremental algorithms for minimal length paths – G Ausiello, G F Italiano, A Marchetti-Spaccamela, U Nanni - 1991
49 Fully dynamic algorithms for maintaining shortest path trees – D Frigioni - 2000
22 Semi-dynamic Algorithms for Maintaining Single-Source Shortest Path Trees – Daniele Frigioni, Alberto Marchetti-spaccamela, Umberto Nanni
45 Updating distances in dynamic graphs – S Even, H Gazit - 1985
67 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
35 Fully Dynamic All Pairs Shortest Paths with Real Edge Weights – Camil Demetrescu, Giuseppe F. Italiano - 2001
24 Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract) – Daniele Frigioni, Alberto Marchetti-spaccamela, Umberto Nanni
19 Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem – Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone - 1997
820 Matrix multiplication via arithmetic progressions – D Coppersmith, S Winograd - 1987
11 The effect of increasing or decreasing the length of a single arc on all shortest distances in a graph – J Murchland - 1967
11 The parametric problem of shortest distances – V Rodionov - 1968
8 A dynamization of the all-pairs least cost problem – H Rohnert - 1985
167 Faster Shortest-Path Algorithms for Planar Graphs – Philip Klein , Satish Rao, Monika Rauch, Sairam Subramanian - 1994
14 A network evaluation procedure – P S Loubal - 1967
61 Mathematics for the analysis of algorithms. Birkhäuser – D Greene, D Knuth - 1982
54 Planar Graphs, Negative Weight Edges, Shortest Paths, and Near Linear Time – Jittat Fakcharoenphol, Satish Rao - 2001
16 A space saving trick for directed dynamic transitive closure and shortest path algorithms – V King, M Thorup - 2001