| ii Datum des Kolloquiums: 21.10.2002 (2008) | |||||||||||||||
Abstract | |||||||||||||||
| Abstract. We study the performance of algorithms for the Single-Source Shortest-Paths (SSSP) problem on graphs with nodes ¡ and edges with nonnegative random weights. All previously known SSSP algorithms for directed graphs required superlinear time. We give the first SSSP algorithms that provably achieve linear ¢¤ £ ¡¨ § average-case execution time on arbitrary directed graphs with random edge weights. For independent edge weights, the linear-time bound holds with high probability, too. Additionally, our result implies improved average-case bounds for the All-Pairs Shortest-Paths (APSP) problem on sparse graphs, and it yields the first theoretical average-case analysis for the “Approximate Bucket Implementation ” of Dijkstra’s SSSP algorithm (ABI–Dijkstra). Furthermore, we give constructive proofs for the existence of graph classes with random edge weights on which ABI–Dijkstra and several other well-known SSSP algorithms require superlinear averagecase time. Besides the classical sequential (single processor) model of computation we also consider parallel computing: we give the currently fastest average-case linear-work parallel SSSP algorithms for large graph classes with random edge weights, e.g., sparse random graphs and graphs modeling the WWW, telephone calls or social networks. Kurzzusammenfassung. In dieser Arbeit untersuchen wir die Laufzeiten von Algorithmen f ür das K ürzeste-Wege Problem (Single-Source Shortest-Paths, SSSP) auf Graphen | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||