Cited in
(24)- Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization
- Relaxation-based coarsening and multiscale graph organization
- Algebraic multigrid methods for Laplacians of graphs
- An efficient memetic algorithm for the graph partitioning problem
- An effective multilevel tabu search approach for balanced graph partitioning
- Advanced coarsening schemes for graph partitioning
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
- An exact combinatorial algorithm for minimum graph bisection
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems
- Massively parallel algorithms for the lattice Boltzmann method on nonuniform grids
- Beyond good partition shapes: an analysis of diffusive graph partitioning
- JOSTLE
- KaFFPa
- Bubble-FOS/C
- FOS/C
- PT-Scotch
- Parkway
- DryadOpt
- KaHIP
- KaHyPar
- Disturbed diffusive processes for solving partitioning problems on graphs
- Multilevel graph partitioning for three-dimensional discrete fracture network flow simulations
- A novel partitioning method for block-structured adaptive meshes
- A bubble-inspired algorithm for finite element mesh partitioning
This page was built for software: DibaP
