97 citations · 392 across the 64 of their papers we have counts for
Showing cs.NEShow all
2 papers · 1 filter
cs.NE2017★ 1 cited
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…
cs.NE2011
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…