22 citations · 34 across the 7 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015
Finding Near-Optimal Independent Sets at Scale
Sebastian Lamm, Peter Sanders, Christian Schulz +2
The independent set problem is NP-hard and particularly difficult to solve in large sparse graphs. In this work, we develop an advanced evolutionary algorithm, which incorporates k…
cs.DS2015★ 1 cited
Graph Partitioning for Independent Sets
Sebastian Lamm, Peter Sanders, Christian Schulz
Computing maximum independent sets in graphs is an important problem in computer science. In this paper, we develop an evolutionary algorithm to tackle the problem. The core innova…