4 citations · 9 across the 4 of their papers we have counts for
4 papers
n-Level Hypergraph Partitioning
Vitali Henne, Henning Meyerhenke, Peter Sanders +2
We develop a multilevel algorithm for hypergraph partitioning that contracts the vertices one at a time and thus allows very high quality. This includes a rating function that avoi…
Structure-Preserving Sparsification of Social Networks
Gerd Lindner, Christian L. Staudt, Michael Hamann +2
Sparsification reduces the size of networks while preserving structural and statistical properties of interest. Various sparsifying algorithms have been proposed in different conte…
Fully-dynamic Approximation of Betweenness Centrality
Elisabetta Bergamini, Henning Meyerhenke
Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths. Since an exact computation is prohibitive in la…
Is Nearly-linear the same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver
Daniel Hoske, Dimitar Lukarski, Henning Meyerhenke +1
Linear system solving is one of the main workhorses in applied mathematics. Recently, theoretical computer scientists have contributed sophisticated algorithms for solving linear s…