I Bustany, G Gasparyan, AB Kahng… - 2023 IEEE/ACM …, 2023 - ieeexplore.ieee.org
With the increasing complexity of IC products, large-scale designs must be efficiently partitioned into multiple blocks, tiles, or devices for concurrent backend place-and-route …
We present a shared-memory parallelization of flow-based refinement, which is considered the most powerful iterative improvement technique for hypergraph partitioning at the …
We present a shared-memory algorithm to compute high-quality solutions to the balanced k- way hypergraph partitioning problem. This problem asks for a partition of the vertex set into k …
L Gottesbüren, M Hamann - European Conference on Parallel Processing, 2022 - Springer
Balanced hypergraph partitioning is a classical NP-hard optimization problem with applications in various domains such as VLSI design, simulating quantum circuits …
Q Wang, L Zheng, J Yuan, Y Huang… - … Symposium on High …, 2022 - ieeexplore.ieee.org
Beyond ordinary graphs, hypergraphs are a graph representation to flexibly express complex multilateral relationships between entities. Hypergraph processing can be used to …
Balanced hypergraph partitioning is a classic NP-hard optimization problem that is a fundamental tool in such diverse disciplines as VLSI circuit design, route planning, sharding …
Balanced hypergraph partitioning is an NP-hard problem with many applications, eg, optimizing communication in distributed data placement problems. The goal is to place all …
Q Wang, L Zheng, A Hu, Y Huang, P Yao… - 2022 55th IEEE/ACM …, 2022 - ieeexplore.ieee.org
Hypergraph processing has emerged as a powerful approach for analyzing complex multilateral relationships among multiple entities. Past research on building hypergraph …
Hypergraphs are applicable to various domains such as social contagion, online groups, and protein structures due to their effective modeling of multivariate relationships. However …