Computing and Combinatorics
From MaRDI portal
Publication:5717009
DOI10.1007/11533719zbMath1128.68400MaRDI QIDQ5717009
Frances A. Rosamond, Michael R. Fellows, Frank Dehne, Michael A. Langston, Kim Stevens
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11533719
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Tractability in constraint satisfaction problems: a survey, Confronting intractability via parameters, FPT algorithms for connected feedback vertex set, 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, Mim-width. II. The feedback vertex set problem, An improved exact algorithm for undirected feedback vertex set, An improved parameterized algorithm for the independent feedback vertex set problem, An Improved Exact Algorithm for Undirected Feedback Vertex Set, FPT Suspects and Tough Customers: Open Problems of Downey and Fellows, Subset Feedback Vertex Set Is Fixed-Parameter Tractable, Unnamed Item, A Linear Kernel for Planar Feedback Vertex Set, Iterative Compression and Exact Algorithms