On the kernelization of split graph problems

DOI10.1016/j.tcs.2017.09.023zbMath1393.68083MaRDI QIDQ2636501

Yongjie Yang, Jiong Guo, Wenjun Li, Yash Raj Shrestha

Publication date: 5 June 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.09.023

zbMATH Keywords

split graph; \(k\)-path; parameterized complexity; kernelization; crown decomposition; \(k\)-cycle

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)