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.
1 code implementation • 11 May 2022 • Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz
A widely-used operation on graphs is local clustering, i. e., extracting a well-characterized community around a seed node without the need to process the whole graph.
1 code implementation • 18 Feb 2021 • Marcelo Fonseca Faraj, Christian Schulz
On the one hand, there are streaming algorithms that have been adopted to partition massive graph data on small machines.
graph partitioning Data Structures and Algorithms