On the Parameterized Complexity of Computing Graph Bisections


The Bisection problem asks for a partition of the vertices of a graph into two equally sized sets, while minimizing the cut size. This is the number of edges connecting the two vertex sets. Bisection has been thoroughly studied in the past. However, only few results have been published that consider the parameterized complexity of this problem. We show that… (More)
DOI: 10.1007/978-3-642-45043-3_8

1 Figure or Table


  • Presentations referencing similar topics