7 citations · 22 across the 8 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015★ 6 cited
k-way Hypergraph Partitioning via n-Level Recursive Bisection
Sebastian Schlag, Vitali Henne, Tobias Heuer +3
We develop a multilevel algorithm for hypergraph partitioning that contracts the vertices one at a time. Using several caching and lazy-evaluation techniques during coarsening and…
cs.DS2015★ 4 cited
n-Level Hypergraph Partitioning
Vitali Henne, Henning Meyerhenke, Peter Sanders +2
We develop a multilevel algorithm for hypergraph partitioning that contracts the vertices one at a time and thus allows very high quality. This includes a rating function that avoi…