Parameterized complexity of even/odd subgraph problems
type: Item
instance of: scholarly article
title: Parameterized complexity of even/odd subgraph problems
zbMATH Open document ID: 1225.05228
author: Leizhen Cai
author: Boting Yang
published in: Journal of Discrete Algorithms
publication date: 2011-08-23T00:00:00Z
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5941896
zbMATH Keywords: parameterized complexity
zbMATH Keywords: FPT algorithms
zbMATH Keywords: Eulerian graphs
zbMATH Keywords: even graphs
zbMATH Keywords: odd graphs
zbMATH Keywords: color-coding
zbMATH Keywords: random separation
MaRDI profile type: Publication
Wikidata QID: Q114162510
full work available at URL: j.jda.2011.03.004
OpenAlex ID: W2035543139
cites work: Color-coding
cites work: Q3003675
cites work: On problems without polynomial kernels
cites work: Fixed-parameter tractability of graph modification problems for hereditary properties
cites work: Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
cites work: Q4393480
cites work: The Parametrized Complexity of Some Fundamental Problems in Coding Theory
cites work: Q4198056
cites work: Parameterized complexity of finding subgraphs with hereditary properties.
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: Q4231923
cites work: Complexity classification of some edge modification problems
cites work: The Spatial Complexity of Oblivious k-Probe Hash Functions
DOI: 10.1016/J.JDA.2011.03.004
description: scientific article; zbMATH DE number 5941896