Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
From MaRDI portal
Publication:5140705
DOI10.4230/LIPIcs.SEA.2018.1zbMath1492.68105arXiv1802.03587OpenAlexW2962835892MaRDI QIDQ5140705
Sebastian Schlag, Peter Sanders, Tobias Heuer
Publication date: 16 December 2020
Full work available at URL: https://arxiv.org/abs/1802.03587
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)
Related Items
Hypergraph Cuts with General Splitting Functions, Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel multilevel algorithms for hypergraph partitioning
- Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
- Modeling hypergraphs by graphs with the same mincut properties
- The university of Florida sparse matrix collection
- Maximum Flows by Incremental Breadth-First Search
- Engineering Multilevel Graph Partitioning Algorithms
- Recent directions in netlist partitioning: a survey
- Maximal Flow Through a Network
- Handbook of Approximation Algorithms and Metaheuristics
- Multiple-way network partitioning
- A new approach to the maximum-flow problem
- On the structure of all minimum cuts in a network and applications
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- An Efficient Heuristic Procedure for Partitioning Graphs
- Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure
- Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies
- An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications
- k-way Hypergraph Partitioning via n-Level Recursive Bisection
- Engineering a direct k-way Hypergraph Partitioning Algorithm
- A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
- Cutsets and partitions of hypergraphs
