The following pages link to (Q2904753):
Displaying 4 items.
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence (Q396653) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Beyond good partition shapes: an analysis of diffusive graph partitioning (Q1934315) (← links)
