Parameterized Complexity of Eulerian Deletion Problems
From MaRDI portal
Publication:3104771
DOI10.1007/978-3-642-25870-1_13zbMath1341.05141MaRDI QIDQ3104771
Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Dániel Marx, Ildikó Schlotter
Publication date: 16 December 2011
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc3883159
05C35: Extremal problems in graph theory
68W20: Randomized algorithms
05C45: Eulerian and Hamiltonian graphs