157 citations · 421 across the 63 of their papers we have counts for
3 papers · 1 filter
Memetic Graph Clustering
Sonja Biedermann, Monika Henzinger, Christian Schulz +1
It is common knowledge that there is no single best strategy for graph clustering, which justifies a plethora of existing approaches. In this paper, we present a general memetic al…
Distributed Evolutionary k-way Node Separators
Peter Sanders, Christian Schulz, Darren Strash +1
Computing high quality node separators in large graphs is necessary for a variety of applications, ranging from divide-and-conquer algorithms to VLSI design. In this work, we prese…
Distributed Evolutionary Graph Partitioning
Peter Sanders, Christian Schulz
We present a novel distributed evolutionary algorithm, KaFFPaE, to solve the Graph Partitioning Problem, which makes use of KaFFPa (Karlsruhe Fast Flow Partitioner). The use of our…