Hitting long directed cycles is fixed-parameter tractable
From MaRDI portal
Cites work
- A fixed-parameter algorithm for the directed feedback vertex set problem
- A randomized algorithm for long directed cycle
- Color-coding
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- DAG-width and circumference of digraphs
- Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time
- Directed subset feedback vertex set is fixed-parameter tractable
- Directed tree-width
- Directed width parameters and circumference of digraphs
- Efficient computation of representative sets with applications in parameterized and exact algorithms
- Families of \(k\)-independent sets
- Faster deterministic \textsc{Feedback Vertex Set}
- Feedback vertex set in mixed graphs
- Finding odd cycle transversals.
- Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
- Graph minors. XIII: The disjoint paths problem
- scientific article; zbMATH DE number 3974318 (Why is no real title available?)
- scientific article; zbMATH DE number 1979503 (Why is no real title available?)
- Improved algorithms for feedback vertex set problems
- On feedback vertex set: new measure and new structures
- On maximal circuits in directed graphs
- Packing directed circuits
- Parameterized algorithms for generalizations of directed feedback vertex set
- Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- The directed grid theorem
- When recursion is better than iteration: a linear-time algorithm for acyclicity with few error vertices
This page was built for publication: Hitting long directed cycles is fixed-parameter tractable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842514)
