On parameterized independent feedback vertex set
From MaRDI portal
Publication:690464
DOI10.1016/J.TCS.2012.02.012zbMATH Open1253.68181OpenAlexW2020889718MaRDI QIDQ690464FDOQ690464
Authors: Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh 
Publication date: 27 November 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.012
Recommendations
- On parameterized independent feedback vertex set
- An improved parameterized algorithm for the independent feedback vertex set problem
- Independent feedback vertex sets for graphs of bounded diameter
- Parameterized and Exact Computation
- Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
- Structural Parameterizations of Feedback Vertex Set
- Approximability of the independent feedback vertex set problem for bipartite graphs
- Approximability of the independent feedback vertex set problem for bipartite graphs
- Simultaneous feedback vertex set: a parameterized perspective
- Simultaneous feedback vertex set: a parameterized perspective
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Finding odd cycle transversals.
- Parametrized complexity theory.
- A 4 k 2 kernel for feedback vertex set
- Hitting forbidden minors: approximation and kernelization
- A fixed-parameter algorithm for the directed feedback vertex set problem
- On feedback vertex set new measure and new structures
- Title not available (Why is that?)
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Title not available (Why is that?)
- Improved algorithms for feedback vertex set problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation algorithms for connected dominating sets
- Linear Kernel for Planar Connected Dominating Set
- Solving connected dominating set faster than \(2^n\)
- Kernelization: new upper and lower bound techniques
- Title not available (Why is that?)
- Title not available (Why is that?)
- Treewidth reduction for constrained separation and bipartization problems
Cited In (32)
- Improved FPT Algorithms for Deletion to Forest-Like Structures.
- Recognizing Graphs Close to Bipartite Graphs
- Conflict free version of covering problems on graphs: classical and parameterized
- On cycle transversals and their connected variants in the absence of a small linear forest
- On group feedback vertex set parameterized by the size of the cutset
- Approximability of the independent feedback vertex set problem for bipartite graphs
- FPT algorithms for connected feedback vertex set
- An improved FPT algorithm for independent feedback vertex set
- On parameterized independent feedback vertex set
- Independent feedback vertex set for \(P_5\)-free graphs
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- Exploring the Kernelization Borders for Hitting Cycles
- Title not available (Why is that?)
- An improved FPT algorithm for almost forest deletion problem
- Independent feedback vertex sets for graphs of bounded diameter
- Circular convex bipartite graphs: feedback vertex sets
- On some hard and some tractable cases of the maximum acyclic matching problem
- Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets
- Independent Feedback Vertex Set for P_5-free Graphs
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
- Deterministic Algorithms for the Independent Feedback Vertex Set Problem
- An improved parameterized algorithm for the independent feedback vertex set problem
- On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
- Improved FPT Algorithms for Deletion to Forest-Like Structures
- Minimization and parameterized variants of vertex partition problems on graphs
- Title not available (Why is that?)
- A polynomial kernel for block graph deletion
- Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
- Structural Parameterizations of Feedback Vertex Set
- Circumventing connectivity for kernelization
- Graph-Theoretic Concepts in Computer Science
- Sparsity in covering solutions
This page was built for publication: On parameterized independent feedback vertex set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690464)
