Parameterized Algorithms for Even Cycle Transversal
From MaRDI portal
Publication:5200504
DOI10.1007/978-3-642-34611-8_19zbMath1341.05248OpenAlexW65530203MaRDI QIDQ5200504
Saket Saurabh, Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan
Publication date: 6 November 2012
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-34611-8_19
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Transversal (matching) theory (05D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (13)
Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs ⋮ Hitting Weighted Even Cycles in Planar Graphs ⋮ An improved deterministic parameterized algorithm for cactus vertex deletion ⋮ Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs ⋮ Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property ⋮ Quick but odd growth of cacti ⋮ Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs ⋮ Exploring the Kernelization Borders for Hitting Cycles ⋮ Computing subset transversals in \(H\)-free graphs ⋮ (In)approximability of maximum minimal FVS ⋮ Faster deterministic algorithm for cactus vertex deletion ⋮ Backdoors to tractable answer set programming ⋮ Fixed-parameter tractability for subset feedback set problems with parity constraints
Uses Software
This page was built for publication: Parameterized Algorithms for Even Cycle Transversal
