Kernels in planar digraphs
type: Item
instance of: scholarly article
title: Kernels in planar digraphs
zbMATH Open document ID: 1170.68547
author: G. Gutin
author: Chuan-Min Lee
author: A. Yeo
author: Ton Kloks
published in: Journal of Computer and System Sciences
publication date: 2005-08-03T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2191676
zbMATH Keywords: Kernels
zbMATH Keywords: Planar digraphs
zbMATH Keywords: Fixed-parameter complexity
MaRDI profile type: Publication
full work available at URL: j.jcss.2005.02.003
OpenAlex ID: W2077761942
cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
cites work: Q4779138
cites work: Polynomial-time data reduction for dominating set
cites work: A classification of locally semicomplete digraphs
cites work: Recent problems and results about kernels in directed graphs
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Advice classes of parametrized tractability
cites work: On the existence of subexponential parameterized algorithms
cites work: Q4850549
cites work: Q4393480
cites work: Q4263467
cites work: Mathematical Foundations of Computer Science 2004
cites work: Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete
cites work: Combinatorial game theory foundations applied to digraph kernels
cites work: Q4471291
cites work: Q4198056
cites work: Q4708588
cites work: Treewidth. Computations and approximations
cites work: Q4748178
cites work: Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview
cites work: Q5844986
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Call routing and the ratcatcher
DOI: 10.1016/J.JCSS.2005.02.003
description: scientific article