Planar graph vertex partition for linear problem kernels
type: Item
instance of: scholarly article
title: Planar graph vertex partition for linear problem kernels
zbMATH Open document ID: 1268.68136
author: Jianxin Wang
author: Yongjie Yang
author: Jiong Guo
author: Jianer Chen
published in: Journal of Computer and System Sciences
publication date: 2013-07-24T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6191045
zbMATH Keywords: parameterized algorithm
zbMATH Keywords: kernelization
zbMATH Keywords: connected vertex cover
zbMATH Keywords: edge dominating set
zbMATH Keywords: maximum triangle packing
MaRDI profile type: Publication
full work available at URL: j.jcss.2012.08.001
OpenAlex ID: W2011167300
cites work: Kernelization: New Upper and Lower Bound Techniques
cites work: Polynomial-time data reduction for dominating set
cites work: Linear Problem Kernels for NP-Hard Problems on Planar Graphs
cites work: The parameterized complexity of the induced matching problem
cites work: Fixed-parameter tractability results for full-degree spanning tree and its dual
cites work: Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set
cites work: Linear Kernel for Planar Connected Dominating Set
cites work: An Improved Kernel for Planar Connected Dominating Set
cites work: (Meta) Kernelization
cites work: Towards optimal kernel for connected vertex cover in planar graphs
cites work: Incompressibility through Colors and IDs
cites work: Bidimensionality and Geometric Graphs
cites work: Q4198056
cites work: New Parameterized Algorithms for the Edge Dominating Set Problem
cites work: A Problem Kernelization for Graph Packing
DOI: 10.1016/J.JCSS.2012.08.001
description: scientific article; zbMATH DE number 6191045