FPT algorithms for connected feedback vertex set
DOI10.1007/S10878-011-9394-2zbMATH Open1258.05060OpenAlexW2007985221MaRDI QIDQ695322FDOQ695322
Authors: Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar 
Publication date: 21 December 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9394-2
Recommendations
- FPT algorithms for connected feedback vertex set
- FPT algorithms for generalized feedback vertex set problems
- Parameterized and Exact Computation
- An improved FPT algorithm for independent feedback vertex set
- An improved FPT algorithm for independent feedback vertex set
- An FPT algorithm for edge subset feedback edge set
- Improved algorithms for feedback vertex set problems
- Improved Algorithms for the Feedback Vertex Set Problems
- Faster fixed parameter tractable algorithms for finding feedback vertex sets
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
group Steiner treeSteiner treeparameterized algorithmsfeedback vertex setFPT algorithmsconnected feedback vertex setdirected Steiner out-treedynamic programming over tree decompositionsH-minor-free graphshardness of polynomial kernelizationsubexponential FPT algorithms
Cites Work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- On feedback vertex set new measure and new structures
- Incompressibility through Colors and IDs
- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
- Title not available (Why is that?)
- Digraphs
- Title not available (Why is that?)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Bidimensionality and Geometric Graphs
- Computing and Combinatorics
- Title not available (Why is that?)
- Connected feedback vertex set in planar graphs
- Solving connected dominating set faster than \(2^n\)
- Linearity of grid minors in treewidth with applications through bidimensionality
- On Problems without Polynomial Kernels (Extended Abstract)
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
Cited In (22)
- Improved FPT Algorithms for Deletion to Forest-Like Structures.
- Improved Parameterized Algorithms for Network Query Problems
- FPT algorithms for connected feedback vertex set
- An improved FPT algorithm for independent feedback vertex set
- A complete parameterized complexity analysis of bounded planning
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- An improved FPT algorithm for almost forest deletion problem
- Finding good 2-partitions of digraphs. I. Hereditary properties
- Dynamic parameterized problems
- Degree-constrained 2-partitions of graphs
- Title not available (Why is that?)
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
- Connected feedback vertex set on AT-free graphs
- Improved FPT Algorithms for Deletion to Forest-Like Structures
- Minimization and parameterized variants of vertex partition problems on graphs
- Finding good 2-partitions of digraphs. II. Enumerable properties
- Circumventing connectivity for kernelization
- Improved parameterized algorithms for network query problems
- On the parameterized complexity of 2-partitions
- Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
- A \(9k\) kernel for nonseparating independent set in planar graphs
- The price of connectivity for cycle transversals
This page was built for publication: FPT algorithms for connected feedback vertex set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q695322)
