Parameterized complexity of connected even/odd subgraph problems

DOI10.1016/j.jcss.2013.07.002zbMath1311.68075OpenAlexW2154257407WikidataQ60488404 ScholiaQ60488404MaRDI QIDQ395000

Fedor V. Fomin, Petr A. Golovach

Publication date: 28 January 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2012/3398/

zbMATH Keywords

treewidthparameterized complexityeven graphodd graphEuler graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Deterministic Truncation of Linear Matroids ⋮ Finding even subgraphs even faster

Cites Work

• Unnamed Item
• Unnamed Item
• Parameterized complexity of even/odd subgraph problems
• Eulerian graphs and related topics. Part 1, Volume 1
• Parametrized complexity theory.
• Parameterized Complexity of Eulerian Deletion Problems
• Color-coding
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Counting Subgraphs via Homomorphisms

This page was built for publication: Parameterized complexity of connected even/odd subgraph problems