187 citations · 581 across the 39 of their papers we have counts for
59 papers
Network Sparsification via Degree- and Subgraph-based Edge Sampling
Zhen Su, Jürgen Kurths, Henning Meyerhenke
Network (or graph) sparsification compresses a graph by removing inessential edges. By reducing the data volume, it accelerates or even facilitates many downstream analyses. Still,…
Algorithms for Large-scale Network Analysis and the NetworKit Toolkit
Eugenio Angriman, Alexander van der Grinten, Michael Hamann +2
The abundance of massive network data in a plethora of applications makes scalable analysis algorithms and software tools necessary to generate knowledge from such data in reasonab…
More Recent Advances in (Hyper)Graph Partitioning
Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj +8
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms. We survey trends of the last decade in practical…
Interactive Visualization of Protein RINs using NetworKit in the Cloud
Eugenio Angriman, Fabian Brandt-Tumescheit, Leon Franke +2
Network analysis has been applied in diverse application domains. In this paper, we consider an example from protein dynamics, specifically residue interaction networks (RINs). In…
Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs
Alexander van der Grinten, Geert Custers, Duy Le Thanh +1
Sparse matrix multiplication (SpGEMM) is a fundamental kernel used in many diverse application areas, both numerical and discrete. For example, many algebraic graph algorithms rely…
The climatic interdependence of extreme-rainfall events around the globe
Zhen Su, Henning Meyerhenke, Jürgen Kurths
The identification of regions of similar climatological behavior can be utilized for the discovery of spatial relationships over long-range scales, including teleconnections. In th…