Shortest Path Tree Computation in Dynamic Graphs

Let G = (V, E, omega) be a simple digraph, in which all edge weights are nonnegative real numbers. Let G' be obtained from G by an application of a set of edge weight updates to G. Let sisinV and let T s and T s ' be Shortest Path Trees (SPTs) rooted at s in G and G', respectively. Th...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on computers 2009-04, Vol.58 (4), p.541-557
Hauptverfasser:	Chan, E.P.F., Yaya Yang
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Data mining Digital signal processing Distance measurement dynamic algorithms dynamic graphs Dynamic shortest path Dynamic tests Dynamics graph algorithms Graph theory Heuristic algorithms Optimization Proposals routing protocol shortest path trees Shortest-path problems State of the art Studies Trees
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!