PARTY
From MaRDI portal
Cited in
(19)- Algorithm 1003: Mongoose, a graph coarsening and partitioning library
- A unified framework of multi-objective cost functions for partitioning unstructured finite element meshes
- Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM
- Linear-time approximation for maximum weight matching
- JOSTLE
- PHAML
- Scotch
- Chaco
- MatlabBGL
- PLUM
- PadFEM
- TOP/DOMDEC
- spectralGraphTopology
- New challenges in dynamic load balancing
- Upper bounds on the bisection width of 3- and 4-regular graphs
- Load balancing fictions, falsehoods and fallacies
- Quality matching and local improvement for multilevel graph-partitioning
- An exact algorithm for graph partitioning
- Finding optimal solutions to the graph partitioning problem with heuristic search
This page was built for software: PARTY
