Scalable high-quality hypergraph partitioning
From MaRDI portal
Cites work
- k-way hypergraph partitioning via n-level recursive bisection
- \(n\)-level graph partitioning
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A fast and robust network bisection algorithm
- A new approach to the maximum-flow problem
- A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
- Algorithm 1002: Graph coloring based parallel push-relabel algorithm for the maximum flow problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- An O(n2log n) parallel max-flow algorithm
- Benchmarking optimization software with performance profiles.
- Cutsets and partitions of hypergraphs
- Deep multilevel graph partitioning
- Deterministic Parallel Hypergraph Partitioning
- Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic
- Distributed Evolutionary Graph Partitioning
- Efficient implementation of a synchronous parallel push-relabel algorithm
- Engineering a direct \(k\)-way hypergraph partitioning algorithm
- Engineering multilevel graph partitioning algorithms
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
- Fast balanced partitioning is hard even on grids and trees
- Fast unfolding of communities in large networks
- Graph bisection with Pareto optimization
- High-Quality Hypergraph Partitioning
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2068045 (Why is no real title available?)
- scientific article; zbMATH DE number 2068046 (Why is no real title available?)
- scientific article; zbMATH DE number 3257830 (Why is no real title available?)
- ILP-Based Local Search for Graph Partitioning
- Improving coarsening schemes for hypergraph partitioning by exploiting community structure
- Maximal Flow Through a Network
- Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
- Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
- Multilevel Hypergraph Partitioning with Vertex Weights Revisited
- Multilevel refinement for combinatorial optimisation problems
- Multiple-way network partitioning
- On implementing the push-relabel method for the maximum flow problem
- On the structure of all minimum cuts in a network and applications
- Parallel optimisation algorithms for multilevel mesh partitioning
- Partitioning hypergraphs in scientific computing applications through vertex separators on graphs
- Recent directions in netlist partitioning: a survey
- Scalable Shared-Memory Hypergraph Partitioning
- Shared-memory \(n\)-level hypergraph partitioning
- Some simplified NP-complete graph problems
- The University of Florida sparse matrix collection
- UMPa: A multi-objective, multi-level partitioner for communication minimization
This page was built for publication: Scalable high-quality hypergraph partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7023570)
