Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
From MaRDI portal
(Redirected from Publication:5075796)
Recommendations
Cites work
- k-way hypergraph partitioning via n-level recursive bisection
- A new approach to the maximum-flow problem
- A PROBE-Based Heuristic for Graph Partitioning
- A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
- An effective multilevel tabu search approach for balanced graph partitioning
- An Efficient Heuristic Procedure for Partitioning Graphs
- An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Better Bounds for Graph Bisection
- Customizable contraction hierarchies
- Cutsets and partitions of hypergraphs
- Engineering a direct \(k\)-way hypergraph partitioning algorithm
- Engineering multilevel graph partitioning algorithms
- Finding good approximate vertex and edge partitions is NP-hard
- Graph bisection with Pareto optimization
- Graph Partitioning and Graph Clustering
- Handbook of Approximation Algorithms and Metaheuristics
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- Improving coarsening schemes for hypergraph partitioning by exploiting community structure
- Introduction to algorithms
- Maximal Flow Through a Network
- Multilevel refinement for combinatorial optimisation problems
- Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
- Network flows. Theory, algorithms, and applications.
- Parallel multilevel algorithms for hypergraph partitioning
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
- Recent directions in netlist partitioning: a survey
- Relaxation-based coarsening for multilevel hypergraph partitioning
- The University of Florida sparse matrix collection
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(5)- Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
- An Updated Experimental Evaluation of Graph Bipartization Methods
- Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
- Deterministic Parallel Hypergraph Partitioning
- Scalable high-quality hypergraph partitioning
This page was built for publication: Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075796)
