Communication Dans Un Congrès Année : 2017

Towards a Polynomial Kernel For Directed Feedback Vertex Set

Résumé

In the Directed Feedback Vertex Set (DFVS) problem, the input is a directed graph D and an integer k. The objective is to determine whether there exists a set of at most k vertices intersecting every directed cycle of D. DFVS was shown to be fixed-parameter tractable when parameterized by solution size by Chen, Liu, Lu, O'Sullivan and Razgon [JACM 2008]; since then, the existence of a polynomial kernel for this problem has become one of the largest open problems in the area of parameterized algorithmics. In this paper, we study DFVS parameterized by the feedback vertex set number of the underlying undirected graph. We provide two main contributions: a polynomial kernel for this problem on general instances, and a linear kernel for the case where the input digraph is embeddable on a surface of bounded genus.

Mots clés

Fichier principal
Vignette du fichier
s00453-020-00777-5.pdf (382.95 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Licence

Dates et versions

hal-01759637 , version 1 (07-11-2025)

Licence

Identifiants

Citer

Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M S Ramanujan. Towards a Polynomial Kernel For Directed Feedback Vertex Set. 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Aug 2017, Aalborg, Denmark. ⟨10.4230/LIPIcs.MFCS.2017.36⟩. ⟨hal-01759637⟩
157 Consultations
32 Téléchargements

Altmetric

Partager

  • More