Parameterized algorithms for generalizations of directed feedback vertex set

DOI10.1007/978-3-030-17402-6_21MaRDI QIDQ5919403zbMATH OpenOpenAlexFDO

Authors Alexander Göke, Dániel Marx, Matthias Mnich

Publication date 6 February 2020

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2003.02483, http://eprints.sztaki.hu/9803/

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Parameterized algorithms for generalizations of directed feedback vertex set
• A fixed-parameter algorithm for the directed feedback vertex set problem
• Towards a polynomial kernel for directed feedback vertex set
• Towards a polynomial kernel for directed feedback vertex set
• On the parameterized complexity of deletion to \(\mathcal{H}\)-free strong components

Cited in

(13)

• Component order connectivity in directed graphs
• Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
• A fixed-parameter algorithm for the directed feedback vertex set problem
• New Parameterized Algorithms for APSP in Directed Graphs
• scientific article; zbMATH DE number 7559446 (Why is no real title available?)
• Parameterized complexity of safe set
• scientific article; zbMATH DE number 7286685 (Why is no real title available?)
• Parameterized algorithms for generalizations of directed feedback vertex set
• Component order connectivity in directed graphs
• A dynamic MaxSAT-based approach to directed feedback vertex sets
• Lossy reduction rules for the directed feedback vertex set problem
• On the parameterized complexity of deletion to \(\mathcal{H}\)-free strong components
• Hitting long directed cycles is fixed-parameter tractable

This page was built for publication: Parameterized algorithms for generalizations of directed feedback vertex set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919403)