Simultaneous Feedback Vertex Set

DOI10.1145/3265027zbMath1485.68169OpenAlexW2963907277WikidataQ129228608 ScholiaQ129228608MaRDI QIDQ5205800

Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh

Publication date: 16 December 2019

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3265027

zbMATH Keywords

kernelfeedback vertex setparameterized complexityedge-colored graphs

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (4)

Simultaneous feedback edge set: a parameterized perspective ⋮ Polynomial Kernel for Interval Vertex Deletion ⋮ Improved FPT Algorithms for Deletion to Forest-Like Structures. ⋮ An improved FPT algorithm for independent feedback vertex set

This page was built for publication: Simultaneous Feedback Vertex Set