Improved Dynamic Reachability Algorithms for Directed Graphs (2002)

View PDF

Download Links

by Liam Roditty , Uri Zwick
Citations:31 - 5 self

Documents Related by Co-Citation

29 A fully dynamic reachability algorithm for directed graphs with an almost linear update time – Liam Roditty, Uri Zwick - 2004
70 A New Approach to Dynamic All Pairs Shortest Paths – Camil Demetrescu, Giuseppe F. Italiano - 2002
1093 Depth first search and linear graph algorithms – Robert Tarjan - 1972
840 Matrix multiplication via arithmetic progressions – D Coppersmith, S Winograd - 1987
9061 Introduction to Algorithms – Matteo Frigo, Volker Strumpen - 2009
42 Fully Dynamic Transitive Closure: Breaking Through The O(n²) Barrier – Camil Demetrescu - 2000
771 Data Structures and Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1983
591 Fibonacci heaps and their uses in improved network optimization algorithms – M L Fredman, R E Tarjan
563 Dynamic Programming and Markov Processes – Ronald A Howard - 1960