scientific article; zbMATH DE number 1979503

zbMath1019.68082MaRDI QIDQ4425958

C. R. Subramanian, Venkatesh Raman, Saket Saurabh

Publication date: 14 September 2003

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items

Parameterized algorithms for feedback set problems and their duals in tournaments, Unnamed Item, Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization, A polynomial kernel for block graph deletion, A Linear Kernel for Planar Feedback Vertex Set, A naive algorithm for feedback vertex set, An improved parameterized algorithm for the independent feedback vertex set problem, On feedback vertex set: new measure and new structures, Subset Feedback Vertex Set Is Fixed-Parameter Tractable, Improved FPT Algorithms for Deletion to Forest-Like Structures., 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, Mim-width. II. The feedback vertex set problem