Pages that link to "Item:Q2816412"
From MaRDI portal
The following pages link to Simple proof of hardness of feedback vertex set (Q2816412):
Displaying 5 items.
- Target set selection for conservative populations (Q2235265) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- Euler Digraphs (Q3120436) (← links)
- Hardness of vertex deletion and project scheduling (Q3191594) (← links)
- Parameterized algorithms for generalizations of directed feedback vertex set (Q5925617) (← links)