On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles

DOI10.1007/978-3-642-32241-9_38zbMath1295.68136OpenAlexW204959020MaRDI QIDQ2914348

Fahad Panolan, Ashutosh Rai

Publication date: 25 September 2012

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-32241-9_38

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Polynomial kernels for vertex cover parameterized by small degree modulators

This page was built for publication: On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles