Vitali Henne

Learn More
Acknowledgments I would like to express my thanks to all of the people who were involved in my thesis. Their suggestions were invaluable and their help was much appreciated. Without their support this thesis would have had to stay incomplete. Foremost I would like to thank my supervisors Prof. My family and friends were of great help to me and a constant(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)
  • 1