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, G.f. (2007). Algorithmic techniques for maintaining shortest routes in dynamic networks. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 171(SPEC. ISS.), 3-15 [10.1016/j.entcs.2006.11.006].

Algorithmic techniques for maintaining shortest routes in dynamic networks

ITALIANO, GIUSEPPE FRANCESCO
2007

Abstract

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.
Pubblicato
Rilevanza internazionale
Articolo
Sì, ma tipo non specificato
Settore ING-INF/05 - Sistemi di Elaborazione delle Informazioni
English
Con Impact Factor ISI
dynamic graph problems; Dynamic networks; dynamic shortest paths
Demetrescu, C., Italiano, G.f. (2007). Algorithmic techniques for maintaining shortest routes in dynamic networks. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 171(SPEC. ISS.), 3-15 [10.1016/j.entcs.2006.11.006].
Demetrescu, C; Italiano, Gf
Articolo su rivista
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/2108/38559
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 8
  • ???jsp.display-item.citation.isi??? ND
social impact