3 papers
cs.SI2022
Local Motif Clustering via (Hyper)Graph Partitioning
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. Recently loca…
cs.DS2022
Recursive Multi-Section on the Fly: Shared-Memory Streaming Algorithms for Hierarchical Graph Partitioning and Process Mapping
Marcelo Fonseca Faraj, Christian Schulz
Partitioning a graph into balanced blocks such that few edges run between blocks is a key problem for large-scale distributed processing. A current trend for partitioning huge grap…
cs.DS2020
High-Quality Hierarchical Process Mapping
Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke +2
Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation when processing graphs on a parallel computer. When a…