Data reduction for directed feedback vertex set on graphs without long induced cycles

We study reduction rules for Directed Feedback Vertex Set (DFVS) on instances without long cycles. A DFVS instance without cycles longer than $d$ naturally corresponds to an instance of $d$-Hitting Set, however, enumerating all cycles in an $n$-vertex graph and then kernelizing the resulting $d$-Hit...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Dirks, Jona, Gerhard, Enna, Grobler, Mario, Mouawad, Amer E, Siebertz, Sebastian
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!