Parameterized Complexity of Even/Odd Subgraph Problems

DOI10.1007/978-3-642-13073-1_9zbMath1284.68291OpenAlexW2167355524MaRDI QIDQ3562994

Boting Yang, Leizhen Cai

Publication date: 28 May 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13073-1_9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Parameterized Complexity of Eulerian Deletion Problems

This page was built for publication: Parameterized Complexity of Even/Odd Subgraph Problems