The following pages link to PARTY (Q32336):
Displaying 10 items.
- A unified framework of multi-objective cost functions for partitioning unstructured finite element meshes (Q837714) (← links)
- Upper bounds on the bisection width of 3- and 4-regular graphs (Q849636) (← links)
- Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM (Q1583338) (← links)
- Quality matching and local improvement for multilevel graph-partitioning (Q1583343) (← links)
- New challenges in dynamic load balancing (Q1765341) (← links)
- An exact algorithm for graph partitioning (Q1942271) (← links)
- Finding optimal solutions to the graph partitioning problem with heuristic search (Q2502154) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- Algorithm 1003 (Q5132310) (← links)
- Load balancing fictions, falsehoods and fallacies (Q5950122) (← links)