Faster fixed parameter tractable algorithms for finding feedback vertex sets
From MaRDI portal
Publication:2944523
DOI10.1145/1159892.1159898zbMath1321.05275MaRDI QIDQ2944523
C. R. Subramanian, Venkatesh Raman, Saket Saurabh
Publication date: 2 September 2015
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1159892.1159898
68Q25: Analysis of algorithms and problem complexity
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters, Unnamed Item, Unnamed Item, Packing Cycles Faster Than Erdos--Posa, On group feedback vertex set parameterized by the size of the cutset, Enumerating minimal subset feedback vertex sets, On feedback vertex set: new measure and new structures, Extremal properties of the bipartite vertex frustration of graphs, Improved algorithms for feedback vertex set problems, Parameterizing above or below guaranteed values, Kernels for deletion to classes of acyclic digraphs, New formulae for the bipartite vertex frustration and decycling number of graphs, Faster deterministic \textsc{Feedback Vertex Set}, Mim-width. II. The feedback vertex set problem, Parameterised algorithms for deletion to classes of DAGs, An improved parameterized algorithm for the independent feedback vertex set problem, Towards a polynomial kernel for directed feedback vertex set, Backdoors to Satisfaction, Subset Feedback Vertex Set Is Fixed-Parameter Tractable, A Quartic Kernel for Pathwidth-One Vertex Deletion, Unnamed Item, Linear Time Parameterized Algorithms for Subset Feedback Vertex Set
