Pages that link to "Item:Q3104772"
From MaRDI portal
The following pages link to Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons (Q3104772):
Displaying 5 items.
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- Corner cuts are close to optimal: from solid grids to polygons and back (Q1949103) (← links)
- Balanced partitions of trees and applications (Q2346962) (← links)
- Balanced tree partition problems with virtual nodes (Q2424724) (← links)
- Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons (Q3104772) (← links)
