On parameterized independent feedback vertex set
From MaRDI portal
Publication:690464
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)
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
Cites work
- Title not available (Why is no real title available?)
- scientific article; zbMATH DE number 6118220 (Why is no real title available?)
- scientific article; zbMATH DE number 512804 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 219251 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A fixed-parameter algorithm for the directed feedback vertex set problem
- A quadratic kernel for feedback vertex set
- Approximation algorithms for connected dominating sets
- Finding odd cycle transversals.
- Hitting forbidden minors: approximation and kernelization
- Improved algorithms for feedback vertex set problems
- Kernelization: new upper and lower bound techniques
- Linear Kernel for Planar Connected Dominating Set
- On feedback vertex set new measure and new structures
- Parametrized complexity theory.
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Solving connected dominating set faster than \(2^n\)
- Treewidth reduction for constrained separation and bipartization problems
Cited in
(33)- Graph-Theoretic Concepts in Computer Science
- An improved parameterized algorithm for the independent feedback vertex set problem
- On some hard and some tractable cases of the maximum acyclic matching problem
- On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
- Independent feedback vertex sets for graphs of bounded diameter
- An improved FPT algorithm for independent feedback vertex set
- An improved FPT algorithm for independent feedback vertex set
- Parameterized complexity of fair feedback vertex set problem
- Sparsity in covering solutions
- Improved FPT Algorithms for Deletion to Forest-Like Structures.
- Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets
- Improved FPT Algorithms for Deletion to Forest-Like Structures
- Conflict free feedback vertex set: a parameterized dichotomy
- Exploring the kernelization borders for hitting cycles
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
- Recognizing Graphs Close to Bipartite Graphs
- Independent Feedback Vertex Set for P_5-free Graphs
- A polynomial kernel for block graph deletion
- Conflict free version of covering problems on graphs: classical and parameterized
- FPT algorithms for connected feedback vertex set
- On cycle transversals and their connected variants in the absence of a small linear forest
- On parameterized independent feedback vertex set
- Deterministic Algorithms for the Independent Feedback Vertex Set Problem
- Independent feedback vertex set for \(P_5\)-free graphs
- scientific article; zbMATH DE number 7378380 (Why is no real title available?)
- Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
- Structural Parameterizations of Feedback Vertex Set
- An improved FPT algorithm for almost forest deletion problem
- Approximability of the independent feedback vertex set problem for bipartite graphs
- Circumventing connectivity for kernelization
- Circular convex bipartite graphs: feedback vertex sets
- Minimization and parameterized variants of vertex partition problems on graphs
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)
