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

26 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
69 A New Approach to Dynamic All Pairs Shortest Paths – Camil Demetrescu, Giuseppe F. Italiano - 2002
64 Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs – Valerie King - 1999
50 Fully dynamic biconnectivity and transitive closure – M R Henzinger, V King - 1995
8495 Introduction to Algorithms – T Cormen, C Leiserson, R Rivest - 1990
987 Depth first search and linear graph algorithms – Robert Tarjan - 1972
797 Matrix multiplication via arithmetic progressions – D Coppersmith, S Winograd - 1990
32 Finding paths and deleting edges in directed acyclic graphs – G F Italiano - 1988
7 An Experimental Study of Dynamic Algorithms for Transitive Closure – Daniele Frigioni, Tobias Miller, Umberto Nanni, Christos Zaroliagis - 2000
39 Maintenance Of Transitive Closures And Transitive Reductions Of Graphs – J.A. La Poutré, J. van Leeuwen, J. A. La, Poutr J. Leeuwen, Vakgroep Informatica - 1987
9 A Faster and Simpler Fully Dynamic Transitive Closure – L Roditty - 2003
25 On dynamic shortest paths problems – L Roditty, U Zwick - 2004
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