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.
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures / Demetrescu, Camil; Giuseppe F., Italiano. - In: JOURNAL OF DISCRETE ALGORITHMS. - ISSN 1570-8667. - 4:3(2006), pp. 353-383. [10.1016/j.jda.2005.12.003]
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
DEMETRESCU, Camil;
2006
Abstract
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.File | Dimensione | Formato | |
---|---|---|---|
VE_2006_11573-129781.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
323.5 kB
Formato
Adobe PDF
|
323.5 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.