Parallel multilevel algorithms for hypergraph partitioning
From MaRDI portal
Recommendations
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
- \(k\)-way hypergraph partitioning via \(n\)-level recursive bisection
- Deterministic Parallel Hypergraph Partitioning
- Parallelization of graph partitioning
- Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
Cites work
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 3487492 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2068046 (Why is no real title available?)
- scientific article; zbMATH DE number 839542 (Why is no real title available?)
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
- An Efficient Heuristic Procedure for Partitioning Graphs
- An Improved Min-Cut Algonthm for Partitioning VLSI Networks
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- DNA electrophoresis studied with the cage model
- Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies
- Finding good approximate vertex and edge partitions is NP-hard
- Graph partitioning models for parallel computing
- Hypergraph-based parallel computation of passage time densities in large semi-Markov models
- New challenges in dynamic load balancing
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
- Parallel static and dynamic multi‐constraint graph partitioning
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- Recent directions in netlist partitioning: a survey
- Uniformization and hypergraph partitioning for the distributed computation of response time densities in very large Markov models
Cited in
(19)- Parallelization domain oriented multilevel graph partitioner
- Hypergraph partitioning for the parallel computing of fuzzy differential equations
- \(k\)-way hypergraph partitioning via \(n\)-level recursive bisection
- Engineering a direct \(k\)-way hypergraph partitioning algorithm
- scientific article; zbMATH DE number 3997175 (Why is no real title available?)
- Improving coarsening schemes for hypergraph partitioning by exploiting community structure
- Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
- Performance-driven layer assignment by integer linear programming and path-constrained hypergraph partitioning
- Relaxation-based coarsening for multilevel hypergraph partitioning
- Cluster partitioning approaches to mapping parallel programs onto a hypercube
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
- Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
- Extension by refining task granularity for parallel computation with variable structures
- Parallel partitioning with Zoltan: is hypergraph partitioning worth it?
- Parallelization of graph partitioning
- scientific article; zbMATH DE number 2075198 (Why is no real title available?)
- Deterministic Parallel Hypergraph Partitioning
- A discrete dynamic convexized method for VLSI circuit partitioning
- Aggregative coarsening for multilevel hypergraph partitioning
This page was built for publication: Parallel multilevel algorithms for hypergraph partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436760)
