Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter

DOI10.1007/s00224-012-9393-4zbMath1286.68196WikidataQ59567529 ScholiaQ59567529MaRDI QIDQ372970

Hans L. Bodlaender, Bart M. P. Jansen

Publication date: 21 October 2013

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-012-9393-4

zbMATH Keywords

vertex cover; kernelization; structural parameterization

Mathematics Subject Classification ID

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

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)