Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
From MaRDI portal
Recommendations
Cited in
(22)- An efficient approach for large scale graph partitioning
- A multilevel tabu search algorithm for balanced partitioning of unstructured grids
- An efficient memetic algorithm for the graph partitioning problem
- scientific article; zbMATH DE number 1862078 (Why is no real title available?)
- Parallel optimisation algorithms for multilevel mesh partitioning
- A group based solution strategy for multi-physics simulations in parallel
- Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic
- Strategies for parallel and numerical scalability of CFD codes
- A mesh partitioning algorithm for preserving spatial locality in arbitrary geometries
- Scalable high-quality hypergraph partitioning
- Multiphase mesh partitioning
- Better Process Mapping and Sparse Quadratic Assignment
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- An effective multilevel tabu search approach for balanced graph partitioning
- Memetic search for the max-bisection problem
- Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
- MPI+X: task-based parallelisation and dynamic load balance of finite element assembly
- scientific article; zbMATH DE number 1760101 (Why is no real title available?)
- Multilevel graph partitioning for three-dimensional discrete fracture network flow simulations
- Unstructured grid adaptation for multiscale finite volume method
- scientific article; zbMATH DE number 1931027 (Why is no real title available?)
- scientific article; zbMATH DE number 2087159 (Why is no real title available?)
This page was built for publication: Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4509972)
