U
Ulrich Meyer
Researcher at Goethe University Frankfurt
Publications - 140
Citations - 3206
Ulrich Meyer is an academic researcher from Goethe University Frankfurt. The author has contributed to research in topics: Shortest path problem & Time complexity. The author has an hindex of 27, co-authored 137 publications receiving 3036 citations. Previous affiliations of Ulrich Meyer include Max Planck Society.
Papers
More filters
Proceedings ArticleDOI
Single-source shortest-paths on arbitrary directed graphs in linear average-case time
TL;DR: In this article, the average case complexity of SSSP on directed graphs with random edge weights uniformly distributed in [0, 1] was studied and it was shown that it needs linear time O(n + m) with high probability.
Book
Algorithms for memory hierarchies: advanced lectures
TL;DR: This book discusses the construction of the Memory Hierarchy in Relational DBMSs, Hierarchical Models and Software Tools for Parallel Programming, and an Overview of File System Architectures.
Proceedings ArticleDOI
A computational study of external-memory BFS algorithms
TL;DR: It is demonstrated that some rather simple external-memory BFS algorithms perform significantly better (minutes as compared to hours) than internal- memory BFS, even if more than half of the input resides internally.
$\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
Ulrich Meyer,Peter Sanders +1 more
TL;DR: In this article, the Δ-stepping algorithm, a generalization of Dial's algorithm and the Bellman-Ford algorithm, was proposed for the single source shortest path problem.