Improved Dynamic Reachability Algorithms for Directed Graphs (2002)

Cached

Download Links

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

Documents Related by Co-Citation

28 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
1015 Depth first search and linear graph algorithms – Robert Tarjan - 1972
8668 Introduction to Algorithms – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001
68 A New Approach to Dynamic All Pairs Shortest Paths – Camil Demetrescu, Giuseppe F. Italiano - 2002
810 Matrix multiplication via arithmetic progressions – Don Coppersmith, Shmuel Winograd - 1990
726 Data Structures and Algorithms – Alfred Aho, John Hopcroft, Jeffrey Ullman - 1982
2474 The Design and Analysis of Computer Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1974
609 Data structures and network algorithms – R Tarjan - 1983