research
∙
09/20/2022
Algorithms for Large-scale Network Analysis and the NetworKit Toolkit
The abundance of massive network data in a plethora of applications make...
share
research
∙
03/02/2022
Interactive Visualization of Protein RINs using NetworKit in the Cloud
Network analysis has been applied in diverse application domains. In thi...
research
∙
02/17/2022
Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs
Sparse matrix multiplication (SpGEMM) is a fundamental kernel used in ma...
research
∙
01/15/2021
New Approximation Algorithms for Forest Closeness Centrality – for Individual Vertices and Vertex Groups
The emergence of massive graph data sets requires fast mining algorithms...
research
∙
10/29/2020
Group-Harmonic and Group-Closeness Maximization – Approximation and Engineering
Centrality measures characterize important nodes in networks. Efficientl...
research
∙
06/24/2020
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis
The ubiquity of massive graph data sets in numerous applications require...
research
∙
01/20/2020
High-Quality Hierarchical Process Mapping
Partitioning graphs into blocks of roughly equal size such that few edge...
research
∙
11/08/2019
Local Search for Group Closeness Maximization on Big Graphs
In network analysis and graph mining, closeness centrality is a popular ...
research
∙
10/30/2019
Group Centrality Maximization for Large-scale Graphs
The study of vertex centrality measures is a key aspect of network analy...
research
∙
10/24/2019
Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling
Betweenness centrality is one of the most popular vertex centrality meas...
research
∙
03/22/2019
Parallel Adaptive Sampling with almost no Synchronization
Approximation via sampling is a widespread technique whenever exact solu...
research
∙
07/10/2018
