Search Results for author:
Found 6 papers, 5 papers with code
Advanced Flow-Based Multilevel Hypergraph Partitioning
We present an improvement to the flow-based refinement framework of KaHyPar-MF, the current state-of-the-art multilevel $k$-way hypergraph partitioning algorithm for high-quality solutions.
Data Structures and Algorithms
Scalable Shared-Memory Hypergraph Partitioning
With just four cores, Mt-KaHyPar is also slightly faster than the fastest sequential multilevel partitioner PaToH while producing better solutions on 83% of all instances.
Distributed, Parallel, and Cluster Computing
Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies
Graph partitioning has many applications.
Data Structures and Algorithms
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
In particular, our new routing methods enable the use of balanced graph partitioning, which is a high-quality partitioning method without a naturally associated routing algorithm.
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
The solution quality is only marginally worse than that of the best-performing hypergraph partitioners KaHyPar and hMETIS, while being one order of magnitude faster.
Data Structures and Algorithms
More Recent Advances in (Hyper)Graph Partitioning
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms.
