157 citations · 421 across the 63 of their papers we have counts for
5 papers · 1 filter
Finding Near-Optimal Weight Independent Sets at Scale
Ernestine Großmann, Sebastian Lamm, Christian Schulz +1
Computing maximum weight independent sets in graphs is an important NP-hard optimization problem. The problem is particularly difficult to solve in large graphs for which data redu…
Scalable Multilevel and Memetic Signed Graph Clustering
Felix Hausberger, Marcelo Fonseca Faraj, Christian Schulz
In this study, we address the complex issue of graph clustering in signed graphs, which are characterized by positive and negative weighted edges representing attraction and repuls…
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…
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…
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…