Parameterized complexity of connected even/odd subgraph problems
type: Item
instance of: scholarly article
zbMATH Open document ID: 1245.68106
author: Fedor V. Fomin
author: Petr A. Golovach
publication date: 2012-08-23T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 6070922
zbMATH Keywords: parameterized complexity
zbMATH Keywords: Euler graph
zbMATH Keywords: even graph
zbMATH Keywords: odd graph
zbMATH Keywords: treewidth
zbMATH Keywords: subgraph
MaRDI profile type: Publication
full work available at URL: LIPIcs.STACS.2012.432
OpenAlex ID: W2266466481
DOI: 10.4230/LIPICS.STACS.2012.432
title: Parameterized complexity of connected even/odd subgraph problems
description: scientific article; zbMATH DE number 6070922