Search Results for author: Vitali Henne

Found 2 papers, 2 papers with code

k-way Hypergraph Partitioning via n-Level Recursive Bisection

1 code implementation ALENEX 2016 2017 Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz

We develop a multilevel algorithm for hypergraph partitioning that contracts the vertices one at a time.

Data Structures and Algorithms

n-Level Hypergraph Partitioning

1 code implementation4 May 2015 Vitali Henne, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz

Using label propagation local search is several times faster than hMetis and gives better quality than PaToH for a VLSI benchmark set.

Data Structures and Algorithms G.2.2; D.1.4

Cannot find the paper you are looking for? You can Submit a new open access paper.