Parameterized algorithms for generalizations of directed feedback vertex set
type: Item
instance of: scholarly article
title: Parameterized algorithms for generalizations of directed feedback vertex set
author: Alexander Göke
author: Dániel Marx
author: Matthias Mnich
published in: Discrete Optimization
publication date: 2023-02-16T00:00:00Z
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7654019
zbMATH Keywords: fixed-parameter algorithms
zbMATH Keywords: directed feedback vertex set
MaRDI profile type: MaRDI publication profile
full work available at URL: j.disopt.2022.100740
OpenAlex ID: W3009264021
cites work: Parameterized algorithms for generalizations of directed feedback vertex set
cites work: Reducibility among Combinatorial Problems
cites work: Packing directed circuits fractionally
cites work: Approximating minimum feedback sets and multicuts in directed graphs
cites work: Divide-and-conquer approximation algorithms via spreading metrics
cites work: Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
cites work: Simple proof of hardness of feedback vertex set
cites work: Q3191594
cites work: Q4608015
cites work: Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
cites work: Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
cites work: Computing the Deficiency of Housing Markets with Duplicate Houses
cites work: What’s Next? Future Directions in Parameterized Complexity
cites work: Q4634403
cites work: Linear kernels for separating a graph into components of bounded size
cites work: A fixed-parameter algorithm for the directed feedback vertex set problem
cites work: The directed subgraph homeomorphism problem
cites work: DAG-width and circumference of digraphs
cites work: Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
cites work: Parameterized complexity of Eulerian deletion problems
cites work: Component order connectivity in directed graphs
cites work: On the computational complexity of vertex integrity and component order connectivity
cites work: Q5089249
DOI: 10.1016/J.DISOPT.2022.100740
description: scientific article; zbMATH DE number 7654019