Fast balanced partitioning is hard even on grids and trees

Andreas Emil Feldmann. Fast balanced partitioning is hard even on grids and trees. Theoretical Computer Science, 485:61-68, 2013. [doi]

Abstract

Abstract is missing.