A Polynomial Kernel for Funnel Arc Deletion Set

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 C - Arc Deletion Set ( C - ADS ), a variant of D...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 84; no. 8; pp. 2358 - 2378
Main Author:	Garlet Milani, Marcelo
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2022 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Apexes Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Deletion Funnels Graph theory Kernels Mathematics of Computing Polynomials Special Issue: Parameterized and Exact Computation (IPEC 2020) Theory of Computation Graph editing Kernels Funnels Parameterized algorithm Directed feedback arc set
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!