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
∙
05/26/2022
More Recent Advances in (Hyper)Graph Partitioning
In recent years, significant advances have been made in the design and e...
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
∙
11/09/2021
Tarema: Adaptive Resource Allocation for Scalable Scientific Workflows in Heterogeneous Clusters
Scientific workflow management systems like Nextflow support large-scale...
research
∙
11/02/2021
The climatic interdependence of extreme-rainfall events around the globe
The identification of regions of similar climatological behavior can be ...
research
∙
07/06/2021
An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures
Processing massive application graphs on distributed memory systems requ...
research
∙
04/27/2021
Fully-dynamic Weighted Matching Approximation in Practice
Finding large or heavy matchings in graphs is a ubiquitous combinatorial...
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
∙
11/03/2020
Distributing Sparse Matrix/Graph Applications in Heterogeneous Clusters – an Experimental Study
Many problems in scientific and engineering applications contain sparse ...
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
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
Network analysis defines a number of centrality measures to identify the...
research
∙
05/03/2018
Balanced k-means for Parallel Geometric Partitioning
Mesh partitioning is an indispensable tool for efficient parallel numeri...
research
∙
04/19/2018
Topology-induced Enhancement of Mappings
In this paper we propose a new method to enhance a mapping μ(·) of a par...
research
∙
02/08/2018
Updating Dynamic Random Hyperbolic Graphs in Sublinear Time
Generative network models play an important role in algorithm developmen...
research
∙
06/18/2016
Mathematical Foundations of the GraphBLAS
The GraphBLAS standard (GraphBlas.org) is being developed to bring the p...
research
∙
04/18/2014
