Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm

Uses Software

SparseMatrix
KaFFPa
Zoltan
DIMACS
DibaP
KaHyPar

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Parallel multilevel algorithms for hypergraph partitioning
An effective multilevel tabu search approach for balanced graph partitioning
Multilevel refinement for combinatorial optimisation problems
Finding good approximate vertex and edge partitions is NP-hard
Better Bounds for Graph Bisection
The university of Florida sparse matrix collection
Engineering Multilevel Graph Partitioning Algorithms
Recent directions in netlist partitioning: a survey
Maximal Flow Through a Network
Handbook of Approximation Algorithms and Metaheuristics
A new approach to the maximum-flow problem
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
An Efficient Heuristic Procedure for Partitioning Graphs
Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
A PROBE-Based Heuristic for Graph Partitioning
Graph Bisection with Pareto Optimization
Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure
An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications
Graph Partitioning and Graph Clustering
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning
k-way Hypergraph Partitioning via n-Level Recursive Bisection
Engineering a direct k-way Hypergraph Partitioning Algorithm
Customizable Contraction Hierarchies
A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
Cutsets and partitions of hypergraphs