Free access
Proceedings
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX)

k-way Hypergraph Partitioning via n-Level Recursive Bisection

Abstract

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 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 performance is even better than the widely used hMetis hypergraph partitioner that uses a classical multilevel algorithm with few levels. Aided by a portfolio-based approach to initial partitioning and adaptive budgeting of imbalance within recursive bipartitioning, we achieve very high quality. We assembled a large benchmark set with 310 hypergraphs stemming from application areas such VLSI, SAT solving, social networks, and scientific computing. Experiments indicate that our algorithm is the method of choice for a wide range of hypergraph partitioning tasks. The algorithm presented in this work forms the basis of our hypergraph partitioning framework KaHyPar (Karlsruhe Hypergraph Partitioning).

Formats available

You can view the full content in the following formats:

Information & Authors

Information

Published In

cover image Proceedings
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
Pages: 53 - 67
Editors: Michael Goodrich, University of California, Irvine, Califronia, USA and Michael Mitzenmacher, Harvard University, Cambridge, Massachusetts, USA
ISBN (Online): 978-1-611974-31-7

History

Published online: 30 December 2015

Authors

Affiliations

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

There are no citations for this item

View Options

View options

PDF

View PDF

Get Access

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share on social media

The SIAM Publications Library now uses SIAM Single Sign-On for individuals. If you do not have existing SIAM credentials, create your SIAM account https://my.siam.org.