157 citations · 421 across the 63 of their papers we have counts for
6 papers · 1 filter
Practical Massively Parallel Sorting
Michael Axtmann, Timo Bingmann, Peter Sanders +1
Previous parallel sorting algorithms do not scale to the largest available machines, since they either have prohibitive communication volume or prohibitive critical path length. We…
(Semi-)External Algorithms for Graph Partitioning and Clustering
Yaroslav Akhremtsev, Peter Sanders, Christian Schulz
In this paper, we develop semi-external and external memory algorithms for graph partitioning and clustering problems. Graph partitioning and clustering are key tools for processin…
Parallel Graph Partitioning for Complex Networks
Henning Meyerhenke, Peter Sanders, Christian Schulz
Processing large complex networks like social networks or web graphs has recently attracted considerable interest. In order to do this in parallel, we need to partition them into p…
Partitioning Complex Networks via Size-constrained Clustering
Henning Meyerhenke, Peter Sanders, Christian Schulz
The most commonly used method to tackle the graph partitioning problem in practice is the multilevel approach. During a coarsening phase, a multilevel graph partitioning algorithm…
Tree-based Coarsening and Partitioning of Complex Networks
Roland Glantz, Henning Meyerhenke, Christian Schulz
Many applications produce massive complex networks whose analysis would benefit from parallel processing. Parallel algorithms, in turn, often require a suitable network partition.…
Exploiting citation networks for large-scale author name disambiguation
Christian Schulz, Amin Mazloumian, Alexander M Petersen +2
We present a novel algorithm and validation method for disambiguating author names in very large bibliographic data sets and apply it to the full Web of Science (WoS) citation inde…