31 citations · 155 across the 25 of their papers we have counts for
Showing 2015 · cs.DSShow all
2 papers · 2 filters
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★ 15 cited
On Minimizing Crossings in Storyline Visualizations
Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk +2
In a storyline visualization, we visualize a collection of interacting characters (e.g., in a movie, play, etc.) by -monotone curves that converge for each interaction, and dive…