High-quality hypergraph partitioning
Hypergraphs are a generalization of graphs where edges (aka nets) are allowed to connect
more than two vertices. They have a similarly wide range of applications as graphs. This …
more than two vertices. They have a similarly wide range of applications as graphs. This …
Engineering a direct k-way Hypergraph Partitioning Algorithm
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 …
into k balanced blocks–without the detour over recursive bipartitioning. In particular, our …
k-way Hypergraph Partitioning via n-Level Recursive Bisection
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 …
at a time. Using several caching and lazy-evaluation techniques during coarsening and …
Hypergraphic partitioning of quantum circuits for distributed quantum computing
W Cambiucci, RM Silveira… - 2023 IEEE International …, 2023 - ieeexplore.ieee.org
When dealing with NISQ computers (Noise Intermediate Scale Quantum), it is widely
accepted that distributing circuits among processing agents is an effective way to increase …
accepted that distributing circuits among processing agents is an effective way to increase …
Smarter k-Partitioning of ZX-Diagrams for Improved Quantum Circuit Simulation
M Sutcliffe - arXiv preprint arXiv:2409.00828, 2024 - arxiv.org
We introduce a novel method for strong classical simulation of quantum circuits based on
optimally k-partitioning ZX-diagrams, reducing each part individually, and then efficiently …
optimally k-partitioning ZX-diagrams, reducing each part individually, and then efficiently …
Clustering of high dimensional handwritten data by an improved hypergraph partition method
T Wang, Y Lu, Y Han - … 13th International Conference, ICIC 2017, Liverpool …, 2017 - Springer
High dimensional data clustering is a difficult task due to the curse of dimensionality.
Traditional clustering methods usually fail to produce meaningful results for high …
Traditional clustering methods usually fail to produce meaningful results for high …
Mosquito host-seeking algorithm based on random walk and game of life
Y Zhu, X Feng, H Yu - Intelligent Computing Theories and Application: 14th …, 2018 - Springer
Abstract Mosquito Host-seeking Algorithm (MHSA) is a novel bionic algorithm. It simulates
the behavior of mosquito seeking host. MHSA can find near-optimum solutions for the …
the behavior of mosquito seeking host. MHSA can find near-optimum solutions for the …