157 citations · 421 across the 63 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016
Scalable Generation of Scale-free Graphs
Peter Sanders, Christian Schulz
We explain how massive instances of scale-free graphs following the Barabasi-Albert model can be generated very quickly in an embarrassingly parallel way. This makes this popular m…
cs.DS2016★ 2 cited
Accelerating Local Search for the Maximum Independent Set Problem
Jakob Dahlum, Sebastian Lamm, Peter Sanders +3
Computing high-quality independent sets quickly is an important problem in combinatorial optimization. Several recent algorithms have shown that kernelization techniques can be use…