187 citations · 581 across the 39 of their papers we have counts for
10 papers · 1 filter
k-way Hypergraph Partitioning via n-Level Recursive Bisection
Sebastian Schlag, Vitali Henne, Tobias Heuer +3
We develop a multilevel algorithm for hypergraph partitioning that contracts the vertices one at a time. Using several caching and lazy-evaluation techniques during coarsening and…
Approximating Betweenness Centrality in Fully-dynamic Networks
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…
Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently
Moritz von Looz, Henning Meyerhenke
In this paper we define the notion of a probabilistic neighborhood in spatial data: Let a set of points in , a query…
Drawing Large Graphs by Multilevel Maxent-Stress Optimization
Henning Meyerhenke, Martin Nöllenburg, Christian Schulz
Drawing large graphs appropriately is an important step for the visual analysis of data from real-world networks. Here we present a novel multilevel algorithm to compute a graph la…
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…