Sciweavers

Share
2 search results - page 1 / 1
» A Space Saving Trick for Directed Dynamic Transitive Closure...
Sort
View
COCOON
2001
Springer
9 years 1 months ago
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
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...
Valerie King, Mikkel Thorup
JDA
2006
184views more  JDA 2006»
8 years 9 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
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...
Camil Demetrescu, Giuseppe F. Italiano
books