Improved Algorithms for the Feedback Vertex Set Problems

DOI10.1007/978-3-540-73951-7_37zbMath1170.68653OpenAlexW1516576670MaRDI QIDQ3603546

Yngve Villanger, Songjian Lu, Yang Liu, Fedor V. Fomin, Jian'er Chen

Publication date: 17 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_37

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms ⋮ Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters ⋮ A Linear Kernel for Planar Feedback Vertex Set ⋮ Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs ⋮ Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs ⋮ Iterative Compression for Exactly Solving NP-Hard Minimization Problems ⋮ Almost 2-SAT is fixed-parameter tractable

This page was built for publication: Improved Algorithms for the Feedback Vertex Set Problems