A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition
type: Item
instance of: scholarly article
title: A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition
zbMATH Open document ID: 1395.68154
author: Wen-Jun Li
author: Binhai Zhu
published in: Theoretical Computer Science
publication date: 2018-06-18T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6890644
zbMATH Keywords: vertex cover
zbMATH Keywords: crown decomposition
zbMATH Keywords: kernelization
zbMATH Keywords: FPT algorithms
zbMATH Keywords: NP-completeness
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.05.004
OpenAlex ID: W2802677919
cites work: An improved kernelization algorithm for \(r\)-set packing
cites work: A kernelization algorithm for \(d\)-hitting set
cites work: Crown structures for vertex cover kernelization
cites work: Improved upper bounds for vertex cover
cites work: Q4503944
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Parametrized complexity theory.
cites work: Q4198056
cites work: Vertex packings: Structural properties and algorithms
cites work: An improved kernelization for \(P_{2}\)-packing
cites work: Towards optimal kernel for edge-disjoint triangle packing
DOI: 10.1016/J.TCS.2018.05.004
description: scientific article; zbMATH DE number 6890644