2019
DOI: 10.48550/arxiv.1911.05520
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A Polynomial Kernel for Funnel Arc Deletion Set

Marcelo Garlet Milani

Abstract: 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 wellknown open problem in parameterized complexity to decide if DFAS admits a kernel of polynomial size. We consider C-Arc Deletion Set (C-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 C. In this work, we choose C to be the class of funnels. Funnel-ADS is NP-hard even if the input is a DAG, but i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 6 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?