Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set

DOI10.4230/LIPICS.IPEC.2016.2MaRDI QIDQ4634385zbMATH OpenOpenAlexFDO

Authors Akanksha Agrawal, Sushmita Gupta, Saket Saurabh, Roohani Sharma

Publication date 10 April 2018

Full work available at URL https://doi.org/10.4230/LIPIcs.IPEC.2016.2

zbMATH Keywords

enumerationexact algorithmfixed parameter tractableindependent feedback vertex set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An improved parameterized algorithm for the independent feedback vertex set problem
• Deterministic Algorithms for the Independent Feedback Vertex Set Problem
• An improved FPT algorithm for independent feedback vertex set
• An improved FPT algorithm for independent feedback vertex set
• Improved Algorithms for the Feedback Vertex Set Problems
• Improved algorithms for feedback vertex set problems
• Approximability of the independent feedback vertex set problem for bipartite graphs
• Approximability of the independent feedback vertex set problem for bipartite graphs
• On parameterized independent feedback vertex set
• On parameterized independent feedback vertex set

Cited in

(28)

• On the number of connected sets in bounded degree graphs
• Independent feedback vertex sets for graphs of bounded diameter
• Independent feedback vertex set for P₅-free graphs
• On the feedback number of 3-uniform linear extremal hypergraphs
• On some hard and some tractable cases of the maximum acyclic matching problem
• An improved parameterized algorithm for the independent feedback vertex set problem
• An Improved Exact Algorithm for Undirected Feedback Vertex Set
• Deterministic Algorithms for the Independent Feedback Vertex Set Problem
• On parameterized independent feedback vertex set
• Improved Algorithms for the Feedback Vertex Set Problems
• Conflict free feedback vertex set: a parameterized dichotomy
• scientific article; zbMATH DE number 7378380 (Why is no real title available?)
• Independent Feedback Vertex Set for P₅-free Graphs
• Exact Computation of Maximum Induced Forest
• An improved FPT algorithm for independent feedback vertex set
• An improved FPT algorithm for independent feedback vertex set
• Approximability of the independent feedback vertex set problem for bipartite graphs
• Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
• Improved FPT Algorithms for Deletion to Forest-Like Structures.
• Optimal schemes for combinatorial query problems with integer feedback
• Improved FPT Algorithms for Deletion to Forest-Like Structures
• Sparsity in covering solutions
• Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets
• Near-bipartiteness on graphs having small dominating sets
• On parameterized independent feedback vertex set
• Roman cycle hitting set
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)

This page was built for publication: Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634385)