Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS

DOI10.1007/978-3-030-24766-9_38OpenAlexW2965089568MaRDI QIDQ2285114

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

Publication date: 16 January 2020

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

zbMATH Keywords

treewidthkerneldfvsimportant separator

Mathematics Subject Classification ID

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

Related Items (5)

On the Complexity of Singly Connected Vertex Deletion ⋮ A polynomial kernel for funnel arc deletion set ⋮ Towards a polynomial kernel for directed feedback vertex 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