Pages that link to "Item:Q4490783"
From MaRDI portal
The following pages link to Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications (Q4490783):
Displayed 7 items.
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem (Q650946) (← links)
- Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers (Q862738) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (Q1273087) (← links)
- A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem (Q1944113) (← links)
- Clustering with qualitative information (Q2568462) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)