More Recent Advances in (Hyper)Graph Partitioning

no code implementations • 26 May 2022 • Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, Dorothea Wagner

In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms.

graph partitioning hypergraph partitioning

Interactive Visualization of Protein RINs using NetworKit in the Cloud

2 code implementations • 2 Mar 2022 • Eugenio Angriman, Fabian Brandt-Tumescheit, Leon Franke, Alexander van der Grinten, Henning Meyerhenke

Network analysis has been applied in diverse application domains.

k-way Hypergraph Partitioning via n-Level Recursive Bisection

1 code implementation • ALENEX 2016 2017 • Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz

We develop a multilevel algorithm for hypergraph partitioning that contracts the vertices one at a time.

Data Structures and Algorithms

n-Level Hypergraph Partitioning

1 code implementation • 4 May 2015 • Vitali Henne, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz

Using label propagation local search is several times faster than hMetis and gives better quality than PaToH for a VLSI benchmark set.

Data Structures and Algorithms G.2.2; D.1.4

Parallel Graph Partitioning for Complex Networks

1 code implementation • 18 Apr 2014 • Henning Meyerhenke, Peter Sanders, Christian Schulz

This paper addresses this problem by parallelizing and adapting the label propagation technique originally developed for graph clustering.

Clustering Graph Clustering +1