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 proposed. 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. © 2005 Elsevier B.V. All rights reserved.
Demetrescu, C., & Italiano, G.F. (2006). Dynamic shortest paths and transitive closure: algorithmic techniques and data structures. JOURNAL OF DISCRETE ALGORITHMS, 4(3), 353-383.
Tipologia: | Articolo su rivista |
Citazione: | Demetrescu, C., & Italiano, G.F. (2006). Dynamic shortest paths and transitive closure: algorithmic techniques and data structures. JOURNAL OF DISCRETE ALGORITHMS, 4(3), 353-383. |
IF: | Con Impact Factor ISI |
Lingua: | English |
Settore Scientifico Disciplinare: | Settore ING-INF/05 - Sistemi di Elaborazione delle Informazioni |
Revisione (peer review): | Sì, ma tipo non specificato |
Tipo: | Articolo |
Rilevanza: | Rilevanza internazionale |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1016/j.jda.2005.12.003 |
Stato di pubblicazione: | Pubblicato |
Data di pubblicazione: | 2006 |
Titolo: | Dynamic shortest paths and transitive closure: algorithmic techniques and data structures |
Autori: | |
Autori: | Demetrescu, C; Italiano, GF |
Appare nelle tipologie: | 01 - Articolo su rivista |