Pages that link to "Item:Q2904753"
From MaRDI portal
The following pages link to Balanced partitions of trees and applications (Q2904753):
Displaying 13 items.
- Approximating minimum \(k\)-section in trees with linear diameter (Q324723) (← links)
- 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)
- Intervals of balanced binary trees in the Tamari lattice (Q764359) (← links)
- Balanced graph partitioning (Q863200) (← links)
- Balanced trees with removals: An exercise in rewriting and proof (Q1193748) (← links)
- Beyond good partition shapes: an analysis of diffusive graph partitioning (Q1934315) (← links)
- Optimized quantum circuit partitioning (Q2024874) (← links)
- Balanced partitions of trees and applications (Q2346962) (← links)
- Balanced tree partition problems with virtual nodes (Q2424724) (← links)
- Improved approximation algorithms for balanced partitioning problems (Q4601910) (← links)
- Minmax tree cover in the Euclidean space (Q5891341) (← links)