Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
From MaRDI portal
Publication:4634385
DOI10.4230/LIPIcs.IPEC.2016.2zbMath1398.68203OpenAlexW2592840164MaRDI QIDQ4634385
Sushmita Gupta, Akanksha Agrawal, Saket Saurabh, Roohani Sharma
Publication date: 10 April 2018
Full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2016.2
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
On the number of connected sets in bounded degree graphs ⋮ On the feedback number of 3-uniform linear extremal hypergraphs ⋮ Independent feedback vertex sets for graphs of bounded diameter ⋮ Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration ⋮ Unnamed Item ⋮ Independent feedback vertex set for \(P_5\)-free graphs ⋮ Improved FPT Algorithms for Deletion to Forest-Like Structures. ⋮ Approximability of the independent feedback vertex set problem for bipartite graphs ⋮ An improved FPT algorithm for independent feedback vertex set ⋮ On some hard and some tractable cases of the maximum acyclic matching problem ⋮ Independent Feedback Vertex Set for P_5-free Graphs
This page was built for publication: Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
