The following pages link to Balanced graph partitioning (Q863200):
Displaying 9 items.
- A heuristic method for solving the problem of partitioning graphs with supply and demand (Q256649) (← links)
- Continuum limit of total variation on point clouds (Q261295) (← links)
- On minimum bisection and related partition problems in graphs with bounded tree width (Q322301) (← links)
- Approximating minimum \(k\)-section in trees with linear diameter (Q324723) (← links)
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Balanced connected graph partition (Q831759) (← links)
- Optimization of the transmission cost of distributed quantum circuits based on merged transfer (Q6101574) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
