Pages that link to "Item:Q4866677"
From MaRDI portal
The following pages link to The bisection width of grid graphs (Q4866677):
Displaying 7 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)
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs (Q2258080) (← links)
- Minimum bisection is NP-hard on unit disk graphs (Q2407090) (← links)
- Brushing without capacity restrictions (Q2449081) (← links)
- Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons (Q3104772) (← links)
