A new kernel for parameterized Max-Bisection above tight lower bound

DOI10.1007/978-3-319-62389-4_16zbMath1433.68179OpenAlexW2729543457MaRDI QIDQ2412411

Senmin Zhu, Qilong Feng, Jianxin Wang

Publication date: 23 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_16

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parameterized complexity, tractability and kernelization (68Q27)

Related Items

New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition