Pages that link to "Item:Q2464330"
From MaRDI portal
The following pages link to An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem (Q2464330):
Displayed 14 items.
- Confronting intractability via parameters (Q465686) (← links)
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- Chordal deletion is fixed-parameter tractable (Q973007) (← links)
- Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
- Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Iterative compression and exact algorithms (Q2268862) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5895104) (← links)