Parameterized algorithms for generalizations of Directed Feedback Vertex Set

The Directed Feedback Vertex Set (DFVS) problem takes as input a directed graph G and seeks a smallest vertex set S that hits all cycles in G. This is one of Karp’s 21 NP-complete problems. Resolving the parameterized complexity status of DFVS was a long-standing open problem until Chen et al. (2008...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete optimization Vol. 46; p. 100740
Main Authors:	Göke, Alexander, Marx, Dániel, Mnich, Matthias
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.11.2022
Subjects:	Directed Feedback Vertex Set Fixed-parameter algorithms Fixed-parameter algorithms Directed Feedback Vertex Set
ISSN:	1572-5286, 1873-636X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!