|
48
|
A New Approach to Dynamic All Pairs Shortest Paths
– Camil Demetrescu, Giuseppe F. Italiano
- 2002
|
|
35
|
Fully Dynamic Transitive Closure: Breaking Through The O(n²) Barrier
– Camil Demetrescu
- 2000
|
|
49
|
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
– Valerie King
- 1999
|
|
17
|
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
– Liam Roditty, Uri Zwick
- 2004
|
|
693
|
Matrix multiplication via arithmetic progressions
– D Coppersmith, S Winograd
- 1990
|
|
6
|
A faster and simpler fully dynamic transitive closure
– L Roditty
- 2003
|
|
801
|
Depth-first search and linear graph algorithms
– R Tarjan
- 1972
|
|
7320
|
Introduction to Algorithms
– T H Cormen, C E Leiserson, R L Rivest, C Stein
- 2001
|
|
43
|
Fully dynamic biconnectivity and transitive closure
– Monika Rauch Henzinger, Valerie King
- 1995
|
|
139
|
Data structures for on-line updating of minimum spanning trees
– G N Frederickson
- 1983
|
|
18
|
Dynamic transitive closure via dynamic matrix inverse
– Piotr Sankowski
- 2004
|
|
107
|
Poly-logarithmic deterministic fully-dynamic graph algorithms I: connectivity and minimum spanning tree
– Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
- 1997
|
|
72
|
Fast rectangular matrix multiplication and applications
– X Huang, V Y Pan
- 1998
|
|
17
|
U.: On dynamic shortest paths problems
– L Roditty, Zwick
- 2004
|
|
31
|
A Fully Dynamic Algorithm for Maintaining the Transitive Closure
– Valerie King, Garry Sagert
- 1999
|
|
10
|
A dynamic topological sort algorithm for directed acyclic graphs
– David J. Pearce, Paul H. J. Kelly
- 2006
|
|
65
|
Incremental evaluation of computational circuits
– B Alpern, R Hoover, B K Rosen, P F Sweeney, F K Zadeck
- 1990
|
|
17
|
Maintaining a topological order under edge insertions
– Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert
- 1996
|
|
13
|
On competitive on-line algorithms for the dynamic priority-ordering problem
– G Ramalingam, T Reps
- 1994
|