Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter

摘要

Kernelization is a concept that enables the formal mathematical analysis of data reduction through the framework of parameterized complexity. Intensive research into the Vertex Cover problem has shown that there is a preprocessing algorithm which given an