Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS

DOI10.1007/978-3-030-24766-9_38MaRDI QIDQ2285114zbMATH OpenOpenAlexFDO

Authors Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi

Publication date 16 January 2020

Full work available at URL https://doi.org/10.1007/978-3-030-24766-9_38

zbMATH Keywords

kerneltreewidthdfvsimportant separator

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Recommendations

• Brief announcement: Treewidth modulator: emergency exit for DFVS
• Towards a polynomial kernel for directed feedback vertex set
• Towards a polynomial kernel for directed feedback vertex set
• Kernels for deletion to classes of acyclic digraphs

Cited in

(5)

• Towards a polynomial kernel for directed feedback vertex set
• On the Complexity of Singly Connected Vertex Deletion
• A polynomial kernel for funnel arc deletion set
• A Polynomial Kernel for Funnel Arc Deletion Set.
• On the complexity of singly connected vertex deletion

This page was built for publication: Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285114)