scientific article; zbMATH DE number 1979503

MaRDI QIDQ4425958zbMATH OpenFDO

Authors Venkatesh Raman, Saket Saurabh, C. R. Subramanian

Publication date 14 September 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2518/25180241.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Faster fixed parameter tractable algorithms for finding feedback vertex sets
• Computing and Combinatorics
• An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem
• Parameterized and Exact Computation
• An Improved Exact Algorithm for Undirected Feedback Vertex Set

Cited in

(27)

• Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth
• Local search is a PTAS for feedback vertex set in minor-free graphs
• Mim-width. II. The feedback vertex set problem
• An improved exact algorithm for undirected feedback vertex set
• A polynomial kernel for block graph deletion
• An improved parameterized algorithm for the independent feedback vertex set problem
• An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem
• An Improved Exact Algorithm for Undirected Feedback Vertex Set
• Faster fixed parameter tractable algorithms for finding feedback vertex sets
• A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width
• scientific article; zbMATH DE number 3848625 (Why is no real title available?)
• A fixed-parameter algorithm for the directed feedback vertex set problem
• A Linear Kernel for Planar Feedback Vertex Set
• On feedback vertex set: new measure and new structures
• scientific article; zbMATH DE number 1443271 (Why is no real title available?)
• Feedback vertex set in mixed graphs
• A naive algorithm for feedback vertex set
• Parameterized and Exact Computation
• Computing and Combinatorics
• Improved FPT Algorithms for Deletion to Forest-Like Structures.
• Improved FPT Algorithms for Deletion to Forest-Like Structures
• Hitting long directed cycles is fixed-parameter tractable
• Parameterized algorithms for feedback set problems and their duals in tournaments
• Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
• Improved algorithms for feedback vertex set problems
• On the minimum feedback vertex set problem: Exact and enumeration algorithms
• A cubic kernel for feedback vertex set and loop cutset

This page was built for publication:

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