Computing and Combinatorics

DOI10.1007/11533719zbMath1128.68400OpenAlexW4376561447MaRDI 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

Mathematics Subject Classification ID

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

Related Items

Tractability in constraint satisfaction problems: a survey ⋮ Unnamed Item ⋮ FPT Suspects and Tough Customers: Open Problems of Downey and Fellows ⋮ Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization ⋮ A Linear Kernel for Planar Feedback Vertex Set ⋮ An improved parameterized algorithm for the independent feedback vertex set problem ⋮ Confronting intractability via parameters ⋮ Subset Feedback Vertex Set Is Fixed-Parameter Tractable ⋮ Improved algorithms for feedback vertex set problems ⋮ On the minimum feedback vertex set problem: Exact and enumeration algorithms ⋮ FPT algorithms for connected feedback vertex set ⋮ A cubic kernel for feedback vertex set and loop cutset ⋮ Iterative Compression and Exact Algorithms ⋮ Mim-width. II. The feedback vertex set problem ⋮ An Improved Exact Algorithm for Undirected Feedback Vertex Set ⋮ An improved exact algorithm for undirected feedback vertex set

This page was built for publication: Computing and Combinatorics