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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 84; H. 8; S. 2358 - 2378
1. Verfasser:	Garlet Milani, Marcelo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.08.2022 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!