Search Results for author:
Found 7 papers, 4 papers with code
SATViz: Real-Time Visualization of Clausal Proofs
Visual layouts of graphs representing SAT instances can highlight the community structure of SAT instances.
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
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
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
