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

Celý popis

Podrobná bibliografia

Vydané v:	Discrete optimization Ročník 46; s. 100740
Hlavní autori:	Göke, Alexander, Marx, Dániel, Mnich, Matthias
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.11.2022
Predmet:	Directed Feedback Vertex Set Fixed-parameter algorithms Fixed-parameter algorithms Directed Feedback Vertex Set
ISSN:	1572-5286, 1873-636X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!