Free access
Proceedings
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX)

Engineering a direct k-way Hypergraph Partitioning Algorithm

Abstract

We develop a fast and high quality multilevel algorithm that directly partitions hypergraphs into k balanced blocks – without the detour over recursive bipartitioning. In particular, our algorithm efficiently implements the powerful FM local search heuristics for the complicated k-way case. This is important for objective functions which depend on the number of blocks connected by a hyperedge. We also remove several further bottlenecks in processing large hyperedges, develop a faster contraction algorithm, and a new adaptive stopping rule for local search. To further reduce the size of hyperedges, we develop a pin-sparsifier based on the min-hashing technique that clusters vertices with similar neighborhood. Extensive experiments indicate that our KaHyPar-partitioner compares favorably with the best previous systems. KaHyPar is faster than hMetis and computes better solutions. KaHyPar's results are considerably better than the (faster) PaToH partitioner.

Formats available

You can view the full content in the following formats:

Information & Authors

Information

Published In

cover image Proceedings
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
Pages: 28 - 42
Editors: Sándor Fekete, TU, Braunschwieg, Germany and Vijaya Ramachandran, UT, Austin, Texas, USA
ISBN (Online): 978-1-61197-476-8

History

Published online: 4 January 2017

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.