Invited: Modern Hypergraph Partitioning: KaHyPar, Mt-KaHyPar, and Beyond
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
Hypergraph partitioning is a standard abstraction for VLSI circuit partitioning. While hypergraphs naturally capture multi-terminal nets, they also arise in a wide range of non-VLSI applications, including sparse matrix computations, scientific simulations, and data-intensive workloads. Historically, many successful hypergraph partitioning tools have been carefully tuned to the requirements of specific application domains, leaving a gap for general-purpose frameworks that deliver high solution quality and scalable performance across diverse classes of instances.
Fields of Study & Subjects
VLSI and FPGA Design Techniques
Complexity and Algorithms in Graphs
Graph Theory and Algorithms
Publication details
- Journal / source
- International Symposium on Physical Design
- Pages
- 254–255
- Publication date
- 15 March 2026
- Language
- EN