Polynomial Kernels for Deletion to Classes of Acyclic Digraphs

Matthias Mnich, Erik Jan van Leeuwen

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

We consider the problem to find a set X of vertices (or arcs) with vertical bar X vertical bar

Original languageEnglish
Pages (from-to)48-76
Number of pages29
JournalDiscrete Optimization
Volume25
Issue numberC
DOIs
Publication statusPublished - Aug 2017

Keywords

  • directed feedback vertex set
  • Kernelization
  • Out-forest
  • Directed feedback vertex set
  • ALGORITHMS
  • FEEDBACK VERTEX SET
  • GRAPHS

Cite this