Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
From MaRDI portal
Publication:2032346
DOI10.1007/s00453-021-00798-8MaRDI QIDQ2032346
Ignasi Sau, Guilherme C. M. Gomes
Publication date: 11 June 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.03134
parameterized complexity; polynomial kernel; FPT algorithm; matching cut; bounded degree cut; distance to cluster