Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices
From MaRDI portal
(Redirected from Publication:436766)
Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
Recommendations
- Multilevel Hypergraph Partitioning with Vertex Weights Revisited
- \(k\)-way hypergraph partitioning via \(n\)-level recursive bisection
- An exact approach for the multi-constraint graph partitioning problem
- Multilevel Acyclic Hypergraph Partitioning
- Engineering a direct \(k\)-way hypergraph partitioning algorithm
- Multilevel algorithms for acyclic partitioning of directed acyclic graphs
- Parallel multilevel algorithms for hypergraph partitioning
- An effective algorithm for multiway hypergraph partitioning
- Constrained Min-Cut Replication for K-Way Hypergraph Partitioning
- Parallel static and dynamic multi‐constraint graph partitioning
Cites work
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
- Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
- An Efficient Heuristic Procedure for Partitioning Graphs
- Compressed Graphs and the Minimum Degree Algorithm
- Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies
- Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories
- How Good is Recursive Bisection?
- Improving the Run Time and Quality of Nested Dissection Ordering
- Multiphase mesh partitioning
- Parallel image restoration using surrogate constraint methods
- Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- Recent directions in netlist partitioning: a survey
- Revisiting Hypergraph Models for Sparse Matrix Partitioning
- Uniformization and hypergraph partitioning for the distributed computation of response time densities in very large Markov models
Cited in
(12)- A survey of direct methods for sparse linear systems
- A reductive approach to hypergraph clustering: an application to image segmentation
- A Matrix Partitioning Interface to PaToH in MATLAB
- Parallel multilevel algorithms for hypergraph partitioning
- Improving unstructured mesh partitions for multiple criteria using mesh adjacencies
- Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
- \(k\)-way hypergraph partitioning via \(n\)-level recursive bisection
- Engineering a direct \(k\)-way hypergraph partitioning algorithm
- Least Squares Estimators of Peptide Species Concentrations Based on Gaussian Mixture Decompositions of Protein Mass Spectra
- An exact approach for the multi-constraint graph partitioning problem
- Constrained Min-Cut Replication for K-Way Hypergraph Partitioning
- Communication Avoiding ILU0 Preconditioner
This page was built for publication: Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436766)
