Pages that link to "Item:Q3092224"
From MaRDI portal
The following pages link to An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs (Q3092224):
Displaying 13 items.
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789) (← links)
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint (Q1652415) (← links)
- Corner cuts are close to optimal: from solid grids to polygons and back (Q1949103) (← links)
- An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs (Q2258080) (← links)
- Balanced partitions of trees and applications (Q2346962) (← links)
- Minimum bisection is NP-hard on unit disk graphs (Q2407090) (← links)
- Balanced tree partition problems with virtual nodes (Q2424724) (← links)
- (Q5140710) (← links)
- Algorithms and complexity for geodetic sets on partial grids (Q6057850) (← links)
- (Q6065396) (← links)
