Pages that link to "Item:Q3452187"
From MaRDI portal
The following pages link to A fixed-parameter algorithm for the directed feedback vertex set problem (Q3452187):
Displaying 21 items.
- Multi-Budgeted Directed Cuts (Q5009480) (← links)
- On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← links)
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs (Q5075794) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
- Tight Localizations of Feedback Sets (Q5102049) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
- (Q5743380) (← links)
- (Q5743512) (← links)
- Chordless Cycle Packing Is Fixed-Parameter Tractable (Q5874543) (← links)
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5895104) (← links)
- Efficient algorithms for measuring the funnel-likeness of DAGs (Q5915704) (← links)
- Parameterized algorithms for generalizations of directed feedback vertex set (Q5925617) (← links)
- Component order connectivity in directed graphs (Q6068236) (← links)
- A parameterized algorithm for subset feedback vertex set in tournaments (Q6076355) (← links)
- A Polynomial Kernel for Funnel Arc Deletion Set. (Q6089658) (← links)
- Recognizing when a preference system is close to admitting a master list (Q6124592) (← links)
- Tree drawings with columns (Q6560148) (← links)
- Search-space reduction via essential vertices (Q6606914) (← links)
- Digraph coloring and distance to acyclicity (Q6614618) (← links)
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes (Q6655669) (← links)
