Henning Meyerhenke | DeepAI

AI Chat

Featured Co-authors

Stephan Günnemann
100 publications
Jeremy Kepner
82 publications
Christian Schulz
62 publications
Odej Kao
58 publications
Carl Yang
55 publications
Peter Sanders
53 publications
Lauritz Thamsen
49 publications
Aydin Buluc
40 publications
John D. Owens
27 publications
Daniel Zügner
19 publications
Hugo Gilbert
19 publications

∙ 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...

0 Eugenio Angriman, et al. ∙

∙ 05/26/2022

More Recent Advances in (Hyper)Graph Partitioning

In recent years, significant advances have been made in the design and e...

0 Umit V. Catalyurek, et al. ∙

∙ 03/02/2022

Interactive Visualization of Protein RINs using NetworKit in the Cloud

Network analysis has been applied in diverse application domains. In thi...

0 Eugenio Angriman, et al. ∙

∙ 02/17/2022

Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs

Sparse matrix multiplication (SpGEMM) is a fundamental kernel used in ma...

0 Alexander van der Grinten, et al. ∙

∙ 11/09/2021

Tarema: Adaptive Resource Allocation for Scalable Scientific Workflows in Heterogeneous Clusters

Scientific workflow management systems like Nextflow support large-scale...

0 Jonathan Bader, et al. ∙

∙ 11/02/2021

The climatic interdependence of extreme-rainfall events around the globe

The identification of regions of similar climatological behavior can be ...

0 Zhen Su, et al. ∙

∙ 07/06/2021

An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures

Processing massive application graphs on distributed memory systems requ...

0 Maria Predari, et al. ∙

∙ 04/27/2021

Fully-dynamic Weighted Matching Approximation in Practice

Finding large or heavy matchings in graphs is a ubiquitous combinatorial...

0 Eugenio Angriman, et al. ∙

∙ 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...

0 Alexander van der Grinten, et al. ∙

∙ 11/03/2020

Distributing Sparse Matrix/Graph Applications in Heterogeneous Clusters – an Experimental Study

Many problems in scientific and engineering applications contain sparse ...

0 Charilaos Tzovas, et al. ∙

∙ 10/29/2020

Group-Harmonic and Group-Closeness Maximization – Approximation and Engineering

Centrality measures characterize important nodes in networks. Efficientl...

0 Eugenio Angriman, et al. ∙

∙ 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...

0 Eugenio Angriman, et al. ∙

∙ 01/20/2020

High-Quality Hierarchical Process Mapping

Partitioning graphs into blocks of roughly equal size such that few edge...

0 Marcelo Fonseca Faraj, et al. ∙

∙ 11/08/2019

Local Search for Group Closeness Maximization on Big Graphs

In network analysis and graph mining, closeness centrality is a popular ...

0 Eugenio Angriman, et al. ∙

∙ 10/30/2019

Group Centrality Maximization for Large-scale Graphs

The study of vertex centrality measures is a key aspect of network analy...

0 Eugenio Angriman, et al. ∙

∙ 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...

0 Alexander van der Grinten, et al. ∙

∙ 03/22/2019

Parallel Adaptive Sampling with almost no Synchronization

Approximation via sampling is a widespread technique whenever exact solu...

0 Alexander van der Grinten, et al. ∙

∙ 07/10/2018

Scalable Katz Ranking Computation in Large Static and Dynamic Graphs

Network analysis defines a number of centrality measures to identify the...

0 Alexander van der Grinten, et al. ∙

∙ 05/03/2018

Balanced k-means for Parallel Geometric Partitioning

Mesh partitioning is an indispensable tool for efficient parallel numeri...

0 Moritz von Looz, et al. ∙

∙ 04/19/2018

Topology-induced Enhancement of Mappings

In this paper we propose a new method to enhance a mapping μ(·) of a par...

0 Roland Glantz, et al. ∙

∙ 02/08/2018

Updating Dynamic Random Hyperbolic Graphs in Sublinear Time

Generative network models play an important role in algorithm developmen...

0 Moritz von Looz, et al. ∙

∙ 06/18/2016

Mathematical Foundations of the GraphBLAS

The GraphBLAS standard (GraphBlas.org) is being developed to bring the p...

0 Jeremy Kepner, et al. ∙

∙ 04/18/2014

Parallel Graph Partitioning for Complex Networks

Processing large complex networks like social networks or web graphs has...

0 Henning Meyerhenke, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world