DibaP
From MaRDI portal
Software:20352
swMATH8343MaRDI QIDQ20352FDOQ20352
Author name not available (Why is that?)
Cited In (15)
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
- An efficient memetic algorithm for the graph partitioning problem
- An exact combinatorial algorithm for minimum graph bisection
- Algebraic multigrid methods for Laplacians of graphs
- Massively parallel algorithms for the lattice Boltzmann method on nonuniform grids
- A bubble-inspired algorithm for finite element mesh partitioning
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems
- An effective multilevel tabu search approach for balanced graph partitioning
- Multilevel graph partitioning for three-dimensional discrete fracture network flow simulations
- Relaxation-Based Coarsening and Multiscale Graph Organization
- Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization
- Beyond good partition shapes: an analysis of diffusive graph partitioning
- Advanced coarsening schemes for graph partitioning
- Disturbed diffusive processes for solving partitioning problems on graphs
- A novel partitioning method for block-structured adaptive meshes
This page was built for software: DibaP
