187 citations · 581 across the 39 of their papers we have counts for
5 papers · 1 filter
Approximating Betweenness Centrality in Large Evolving Networks
Elisabetta Bergamini, Henning Meyerhenke, Christian L. Staudt
Betweenness centrality ranks the importance of nodes by their participation in all shortest paths of the network. Therefore computing exact betweenness values is impractical in lar…
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…
NetworKit: A Tool Suite for Large-scale Complex Network Analysis
Christian L. Staudt, Aleksejs Sazonovs, Henning Meyerhenke
We introduce NetworKit, an open-source software package for analyzing the structure of large complex networks. Appropriate algorithmic solutions are required to handle increasingly…
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.…