Vitali Henne

Learn More
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 avoids nonuniform vertex weights, an efficient " semi-dynamic " hypergraph data structure, a very fast coarsening algorithm, and two new local search algorithms. One is a k-way(More)
We develop a multilevel algorithm for hypergraph partitioning that contracts the vertices one at a time. Using several caching and lazy-evaluation techniques during coarsen-ing and refinement, we reduce the running time by up to two-orders of magnitude compared to a naive n-level algorithm that would be adequate for ordinary graph partitioning. The overall(More)
Many problems in computer science can be represented by a graph and reduced to a graph clustering or k-way partitioning problem. In the classical definition, a graph consists of nodes and edges which usually connect exactly two nodes. Hypergraphs are a generalization of graphs, where every edge can connect an arbitrary number of nodes. Recent results(More)
  • 1