Pages that link to "Item:Q388790"
From MaRDI portal
The following pages link to Fast balanced partitioning is hard even on grids and trees (Q388790):
Displaying 4 items.
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Parameterized complexity of asynchronous border minimization (Q1755787) (← links)
- Balanced partitions of trees and applications (Q2904753) (← links)
- Balanced Connected Partitioning of Unweighted Grid Graphs (Q5005141) (← links)