scientific article; zbMATH DE number 219251

zbMath0815.05040MaRDI QIDQ4694737

Hans L. Bodlaender

Publication date: 29 June 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

minorfeedback vertex setvertex disjoint cyclesedge disjoint cyclesmembership test algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

A polynomial kernel for block graph deletion, A note on disjoint cycles, On the tractability of some natural packing, covering and partitioning problems, Fixed-parameter tractability and completeness II: On completeness for W[1], Exploring the Kernelization Borders for Hitting Cycles, Advice classes of parametrized tractability, Improved FPT Algorithms for Deletion to Forest-Like Structures., On parameterized independent feedback vertex set