187 citations · 581 across the 39 of their papers we have counts for
4 papers · 1 filter
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
Alexander van der Grinten, Elisabetta Bergamini, Oded Green +2
Network analysis defines a number of centrality measures to identify the most central nodes in a network. Fast computation of those measures is a major challenge in algorithmic net…
Balanced k-means for Parallel Geometric Partitioning
Moritz von Looz, Charilaos Tzovas, Henning Meyerhenke
Mesh partitioning is an indispensable tool for efficient parallel numerical simulations. Its goal is to minimize communication between the processes of a simulation while achieving…
Topology-induced Enhancement of Mappings
Roland Glantz, Maria Predari, Henning Meyerhenke
In this paper we propose a new method to enhance a mapping of a parallel application's computational tasks to the processing elements (PEs) of a parallel computer. The i…
Updating Dynamic Random Hyperbolic Graphs in Sublinear Time
Moritz von Looz, Henning Meyerhenke
Generative network models play an important role in algorithm development, scaling studies, network analysis, and realistic system benchmarks for graph data sets. A complex network…