Sciweavers

Share
JDA
2006

Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures

8 years 10 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 dynamic shortest paths. Although research on these problems spans over more than three decades, in the last couple of years many novel algorithmic techniques have been . In this survey, we will make a special effort to abstract some combinatorial and algebraic properties, and some common data-structural tools that are at the base of those techniques. This will help us try to present some of the newest results in a unifying framework so that they can be better understood and deployed also by non-specialists. This work has been partially supported by the Sixth Framework Programme of the EU under contract number 507613 (Network of Excellence "EuroNGI: Designing and Engineering of the Next Generation Internet"), and number 001907 ("DELIS : Dynamically Evolving, Large Scale Information Systems&quo...
Camil Demetrescu, Giuseppe F. Italiano
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where JDA
Authors Camil Demetrescu, Giuseppe F. Italiano
Comments (0)
books