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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 84; číslo 8; s. 2358 - 2378
Hlavní autor:	Garlet Milani, Marcelo
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.08.2022 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!