Search Results for author:
Found 11 papers, 7 papers with code
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.
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
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
Multilevel Acyclic Hypergraph Partitioning
The acyclic hypergraph partitioning problem is to partition the hypernodes of a directed acyclic hypergraph into a given number of blocks of roughly equal size such that the corresponding quotient graph is acyclic while minimizing an objective function on the partition.
Faster Support Vector Machines
The time complexity of support vector machines (SVMs) prohibits training on huge data sets with millions of data points.
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
We present a refinement framework for multilevel hypergraph partitioning that uses max-flow computations on pairs of blocks to improve the solution quality of a $k$-way partition.
Data Structures and Algorithms G.2.2; G.2.3
Memetic Multilevel Hypergraph Partitioning
Hypergraph partitioning has a wide range of important applications such as VLSI design or scientific computing.
Data Structures and Algorithms
Engineering a direct k-way Hypergraph Partitioning Algorithm
We also remove several further bottlenecks in processing large hyperedges, develop a faster contraction algorithm, and a new adaptive stopping rule for local search.
Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure
We present an improved coarsening process for multilevel hypergraph partitioning that incorporates global information about the community structure.
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.
Data Structures and Algorithms
n-Level Hypergraph Partitioning
Using label propagation local search is several times faster than hMetis and gives better quality than PaToH for a VLSI benchmark set.
Data Structures and Algorithms G.2.2; D.1.4
