The following pages link to (Q4633907):
Displaying 11 items.
- Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639) (← links)
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- Balanced connected graph partition (Q831759) (← links)
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint (Q1652415) (← links)
- Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
- Balanced partitions of trees and applications (Q2346962) (← links)
- Balanced tree partition problems with virtual nodes (Q2424724) (← links)
- Metaheuristics for the minimum gap graph partitioning problem (Q2668747) (← links)
- Minimum nonuniform graph partitioning with unrelated weights (Q4610203) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- Dynamic Balanced Graph Partitioning (Q5130579) (← links)
