Feedback Vertex Set on Graphs of Low Cliquewidth

DOI10.1007/978-3-642-10217-2_14zbMath1267.05247OpenAlexW2163735772MaRDI QIDQ3651539

Jan Arne Telle, Martin Vatshelle, Binh-Minh Bui-Xuan

Publication date: 11 December 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_14

zbMATH Keywords

dynamic programmingminimum feedback vertex set problemvertices meeting all cycles

Mathematics Subject Classification ID

Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Kernelization for feedback vertex set via elimination distance to a forest ⋮ Tree-representation of set families and applications to combinatorial decompositions ⋮ Boolean-width of graphs

This page was built for publication: Feedback Vertex Set on Graphs of Low Cliquewidth