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
Book ChapterDOI
An O(n 2.75 ) algorithm for online topological ordering
TL;DR: In this paper, the authors present a simple algorithm which maintains the topological order of a directed acyclic graph with n nodes under an online edge insertion sequence in O(n 2.75 ) time, independent of the number of edges m inserted.
Time-independent gossiping on full-port tori
Ulrich Meyer,Jop F. Sibeyn +1 more
TL;DR: Near-optimal gossiping algorithms are given for two and higher dimensional tori, where the amount of data each PU contributes is so large that start-up time may be neglected.
Journal ArticleDOI
An O(n2.75) algorithm for incremental topological ordering
TL;DR: A simple algorithm which maintains the topological order of a directed acyclic graph (DAG) with n nodes, under an online edge insertion sequence, in O(n) time, independent of the number of edges inserted.
Proceedings ArticleDOI
I/O-efficient Generation of Massive Graphs Following the LFR Benchmark.
TL;DR: EM-LFR is presented, the first external memory algorithm able to generate massive complex networks following the LFR benchmark and evidence that both implementations yield graphs with matching properties by applying clustering algorithms to generated instances is given.