Parameterized and Exact Computation

DOI10.1007/b100584zbMath1104.68541OpenAlexW2475962691MaRDI QIDQ5311516

Michael J. Pelsmajer, Marcus Schaefer, Iyad A. Kanj

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100584

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

On the Complexity of Singly Connected Vertex Deletion, Unnamed Item, Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization, A polynomial kernel for block graph deletion, A parameterized algorithm for subset feedback vertex set in tournaments, A Linear Kernel for Planar 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 algorithms for feedback vertex set problems, A cubic kernel for feedback vertex set and loop cutset, Faster deterministic \textsc{Feedback Vertex Set}, A Quartic Kernel for Pathwidth-One Vertex Deletion, An improved FPT algorithm for independent feedback vertex set, Mim-width. II. The feedback vertex set problem, Unnamed Item, On the complexity of singly connected vertex deletion, On group feedback vertex set parameterized by the size of the cutset