An improved FPT algorithm for independent feedback vertex set

DOI10.1007/s00224-020-09973-wOpenAlexW2793238512MaRDI QIDQ5918287

Marcin Pilipczuk, Shao-hua Li

Publication date: 11 June 2021

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-020-09973-w

zbMATH Keywords

branchingparameterized algorithmsindependent feedback vertex set

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On group feedback vertex set parameterized by the size of the cutset
• FPT algorithms for path-transversal and cycle-transversal problems
• On feedback vertex set: new measure and new structures
• On parameterized independent feedback vertex set
• FPT algorithms for connected feedback vertex set
• Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
• Improved algorithms for feedback vertex set problems
• Faster deterministic \textsc{Feedback Vertex Set}
• Half-integrality, LP-branching, and FPT Algorithms
• Subset Feedback Vertex Set Is Fixed-Parameter Tractable
• ON DISJOINT CYCLES
• Linear Time Parameterized Algorithms for S <scp>ubset</scp> F <scp>eedback</scp> V <scp>ertex</scp> S <scp>et</scp>
• Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
• Representative Sets and Irrelevant Vertices
• Simultaneous Feedback Vertex Set
• Parameterized and Exact Computation
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
• Parameterized Algorithms
• An improved FPT algorithm for independent feedback vertex set

This page was built for publication: An improved FPT algorithm for independent feedback vertex set