Improved Dynamic Reachability Algorithms for Directed Graphs (2002)


Download Links

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

Active Bibliography

9 Dynamic shortest paths and transitive closure: algorithmic techniques and data structures – Camil Demetrescu - 2006
1 Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure – Camil Demetrescu, Giuseppe F. Italiano - 2002
6 Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n²) barrier – Camil Demetrescu, Giuseppe F. Italiano - 2005
27 A fully dynamic reachability algorithm for directed graphs with an almost linear update time – Liam Roditty, Uri Zwick - 2004
43 A Fully Dynamic Algorithm for Maintaining the Transitive Closure – Valerie King, Garry Sagert - 1999
2 An Experimental Study of Algorithms for Fully Dynamic Transitive Closure ∗ – Ioannis Krommidas, Christos Zaroliagis, Ioannis Krommidas, Christos Zaroliagis - 2007
41 Fully Dynamic Transitive Closure: Breaking Through The O(n²) Barrier – Camil Demetrescu - 2000
35 Fully Dynamic All Pairs Shortest Paths with Real Edge Weights – Camil Demetrescu, Giuseppe F. Italiano - 2001
2 Decremental Clique Problem – Fabrizio Grandoni, Giuseppe F. Italiano
Improved Deterministic Algorithms for Decremental Transitive Closure and Strongly Connected Components – Jakub Łącki
3 Improved Algorithms for Maintaining Transitive Closure and All-pairs Shortest Paths in Digraphs under edge deletions – Surender Baswana, Ramesh Hariharan, Sandeep Sen - 2001
7 An Experimental Study of Dynamic Algorithms for Transitive Closure – Daniele Frigioni, Tobias Miller, Umberto Nanni, Christos Zaroliagis - 2000
3 Algorithmic techniques for maintaining shortest routes in dynamic networks – Camil Demetrescu
4 Dynamic connectivity: Connecting to networks and geometry – Timothy M. Chan, Liam Roditty - 2008
7 Exact Algorithms for Hard Graph Problems – Fabrizio Grandoni - 2004
7 Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths – Camil Demetrescu, Giuseppe F. Italiano
DAGGER: A Scalable Index for Reachability Queries in Large Dynamic Graphs – Hilmi Yildirim, Vineet Chaoji, Mohammed J. Zaki - 1301
6 Fully Dynamic Planarity Testing with Applications – Zvi Galil, et al.
7 Online Algorithms for Topological Order and Strongly Connected Components – David J. Pearce, Department Of Computing, Paul H. J. Kelly - 2003