2026-07-23T04:27:00Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13316 2024-03-06T10:51:41Z ddc:004 open_access

A Polynomial Kernel for Funnel Arc Deletion Set Garlet Milani, Marcelo graph editing directed feedback arc set parameterized algorithm kernels funnels In Directed Feedback Arc Set (DFAS) we search for a set of at most k arcs which intersect every cycle in the input digraph. It is a well-known open problem in parameterized complexity to decide if DFAS admits a kernel of polynomial size. We consider 𝒞-Arc Deletion Set (𝒞-ADS), a variant of DFAS where we want to remove at most k arcs from the input digraph in order to turn it into a digraph of a class 𝒞. In this work, we choose 𝒞 to be the class of funnels. Funnel-ADS is NP-hard even if the input is a DAG, but is fixed-parameter tractable with respect to k. So far no polynomial kernel for this problem was known. Our main result is a kernel for Funnel-ADS with 𝒪(k⁶) many vertices and 𝒪(k⁷) many arcs, computable in 𝒪(nm) time, where n is the number of vertices and m the number of arcs of the input digraph. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Marcelo Garlet Milani 2020 Is Part Of LIPIcs, Volume 180, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.IPEC.2020.13 urn:nbn:de:0030-drops-133163 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.13 eng https://creativecommons.org/licenses/by/3.0/legalcode