Improved Dynamic Reachability Algorithms for Directed Graphs (2002)

Cached

Download Links

by Liam Roditty , Uri Zwick
Citations:29 - 3 self

Documents Related by Co-Citation

27 A fully dynamic reachability algorithm for directed graphs with an almost linear update time – Liam Roditty, Uri Zwick - 2004
41 Fully Dynamic Transitive Closure: Breaking Through The O(n²) Barrier – Camil Demetrescu - 2000
73 A New Approach to Dynamic All Pairs Shortest Paths – Camil Demetrescu, Giuseppe F. Italiano - 2002
51 Fully dynamic biconnectivity and transitive closure – M R Henzinger, V King - 1995
9 A Faster and Simpler Fully Dynamic Transitive Closure – L Roditty - 2003
67 Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs – Valerie King - 1999
996 Depth first search and linear graph algorithms – Robert Tarjan - 1972
156 Two algorithms for maintaining order in a list – P Dietz, D Sleator - 1987
20 Dynamic Transitive Closure via Dynamic Matrix Inverse – P Sankowski
15 On competitive on-line algorithms for the dynamic priorityordering problem – G Ramalingam, T W Reps - 1994
19 On-line Graph Algorithms for Incremental Compilation – Alberto Marchetti-Spaccamela, Hans Rohnert, Umberto Nanni - 1992
12 The sather language compiler/debugger implementation – Stephen M Omohundro, Chu-Cheow Lim, Jeff Bilmes - 1992
16 A dynamic topological sort algorithm for directed acyclic graphs – David J. Pearce, Paul H. J. Kelly - 2006
22 Maintaining a topological order under edge insertions – Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert - 1996
9 An O(n 2.75 ) algorithm for online topological ordering – Deepak Ajwani, Tobias Friedrich, Ulrich Meyer - 2006
17 Online topological ordering – Irit Katriel, Hans L Bodlaender - 2005
72 Zadeck, “Incremental evaluation of computational circuits – B Alpern, R Hoover, B K Rosen, P F Sweeney, F K - 1990
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
28 On dynamic shortest paths problems – L Roditty, U Zwick - 2004