On the Parameterized Complexity of Computing Graph Bisections

Download PDF
Open Webpage

René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý

Published: 2013, Last Modified: 21 May 2024WG 2013EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: 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.