The parameterized complexity of editing graphs for bounded degeneracy
type: Item
instance of: scholarly article
title: The parameterized complexity of editing graphs for bounded degeneracy
zbMATH Open document ID: 1207.05200
author: Luke Mathieson
published in: Theoretical Computer Science
publication date: 2010-08-11T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5768913
zbMATH Keywords: combinatorial problems
zbMATH Keywords: computational complexity
zbMATH Keywords: parameterized complexity
zbMATH Keywords: degenerate graphs
zbMATH Keywords: graph editing
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.05.015
OpenAlex ID: W1980876266
cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
cites work: Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
cites work: Nondeterminism within $P^ * $
cites work: Machine-based methods in parameterized complexity theory
cites work: Q3549698
cites work: Q4342632
cites work: Q4850549
cites work: Q4393480
cites work: Deciding first-order properties of locally tree-decomposable structures
cites work: Parametrized complexity theory.
cites work: Parameterized Complexity for Domination Problems on Degenerate Graphs
cites work: Lower bound of the Hadwiger number of graphs by their average degree
cites work: k-Degenerate Graphs
cites work: Parameterized Graph Editing with Chosen Vertex Degrees
cites work: Parameterized complexity of finding regular induced subgraphs
cites work: Backdoor sets for DLL subsolvers
cites work: The extremal function for complete minors
DOI: 10.1016/J.TCS.2010.05.015
description: scientific article; zbMATH DE number 5768913