Pages that link to "Item:Q671377"
From MaRDI portal
The following pages link to A note on approximation of the vertex cover and feedback vertex set problems -- Unified approach (Q671377):
Displaying 6 items.
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (Q1273087) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- An approximation algorithm for the \(l\)-pseudoforest deletion problem (Q2285146) (← links)
- On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← links)
- A naive algorithm for feedback vertex set (Q5240414) (← links)
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) (← links)