In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem 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. © 2007 Elsevier B.V. All rights reserved.
Demetrescu C, & Italiano GF (2007). Algorithmic techniques for maintaining shortest routes in dynamic networks. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 171(SPEC. ISS.), 3-15.
Tipologia: | Articolo su rivista |
Citazione: | Demetrescu C, & Italiano GF (2007). Algorithmic techniques for maintaining shortest routes in dynamic networks. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 171(SPEC. ISS.), 3-15. |
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.entcs.2006.11.006 |
Stato di pubblicazione: | Pubblicato |
Data di pubblicazione: | 2007 |
Titolo: | Algorithmic techniques for maintaining shortest routes in dynamic networks |
Autori: | |
Autori: | Demetrescu C; Italiano GF |
Appare nelle tipologie: | 01 - Articolo su rivista |