9 papers
New Approximation Algorithms for Forest Closeness Centrality -- for Individual Vertices and Vertex Groups
Alexander van der Grinten, Eugenio Angriman, Maria Predari +1
The emergence of massive graph data sets requires fast mining algorithms. Centrality measures to identify important vertices belong to the most popular analysis methods in graph mi…
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis
Eugenio Angriman, Maria Predari, Alexander van der Grinten +1
The ubiquity of massive graph data sets in numerous applications requires fast algorithms for extracting knowledge from these data. We are motivated here by three electrical measur…
High-Quality Hierarchical Process Mapping
Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke +2
Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation when processing graphs on a parallel computer. When a…
Local Search for Group Closeness Maximization on Big Graphs
Eugenio Angriman, Alexander van der Grinten, Henning Meyerhenke
In network analysis and graph mining, closeness centrality is a popular measure to infer the importance of a vertex. Computing closeness efficiently for individual vertices receive…
Group Centrality Maximization for Large-scale Graphs
Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski +3
The study of vertex centrality measures is a key aspect of network analysis. Naturally, such centrality measures have been generalized to groups of vertices; for popular measures i…
Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling
Alexander van der Grinten, Henning Meyerhenke
Betweenness centrality is one of the most popular vertex centrality measures in network analysis. Hence, many (sequential and parallel) algorithms to compute or approximate between…