Pages that link to "Item:Q3603546"
From MaRDI portal
The following pages link to Improved Algorithms for the Feedback Vertex Set Problems (Q3603546):
Displaying 7 items.
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
- Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters (Q3503572) (← links)
- A Linear Kernel for Planar Feedback Vertex Set (Q3503587) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) (← links)
- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs (Q5452161) (← links)
