Exact Computation of Maximum Induced Forest
From MaRDI portal
Publication:5757894
DOI10.1007/11785293_17zbMath1141.05340OpenAlexW1563108031MaRDI QIDQ5757894
Publication date: 7 September 2007
Published in: Algorithm Theory – SWAT 2006 (Search for Journal in Brave)
Full work available at URL: https://www.dcs.bbk.ac.uk/~igor/papers/proceedings/SWAT06_razgon.pdf
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Faster exact algorithms for some terminal set problems ⋮ Spotting Trees with Few Leaves ⋮ Spotting Trees with Few Leaves ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ A Moderately Exponential Time Algorithm for Full Degree Spanning Tree ⋮ Large Induced Subgraphs via Triangulations and CMSO ⋮ A Linear Kernel for Planar Feedback Vertex Set ⋮ Exact Algorithms for Edge Domination ⋮ Exact Solution Algorithms for the Chordless Cycle Problem ⋮ Sharp separation and applications to exact and parameterized algorithms ⋮ Exact algorithms for edge domination ⋮ An improved parameterized algorithm for the independent feedback vertex set problem ⋮ Enumerating minimal subset feedback vertex sets ⋮ An exact algorithm for the minimum dominating clique problem ⋮ Improved algorithms for feedback vertex set problems ⋮ Solving connected dominating set faster than \(2^n\) ⋮ On the minimum feedback vertex set problem: Exact and enumeration algorithms ⋮ A cubic kernel for feedback vertex set and loop cutset ⋮ An Improved Exact Algorithm for Undirected Feedback Vertex Set ⋮ An improved exact algorithm for undirected feedback vertex set
