2 search results - page 1 / 1 » A Space Saving Trick for Directed Dynamic Transitive Closure... |
COCOON
2001
Springer
13 years 8 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
JDA
2006
13 years 4 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...