An improved kernel for Max-Bisection above tight lower bound
Theoretical Computer Science, pp. 12-21, 2020.
We study kernelizations for Max-Bisection above Tight Lower Bound, which is to decide if a given graph G=(V,E) admits a bisection with at least ⌈|E|/2⌉+k crossing edges. The best known kernel for this problem has 16k vertices. Based on the Gallai–Edmonds decomposition, we divide the vertices of G into several categories and study the role...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)