Pages that link to "Item:Q1641092"
From MaRDI portal
The following pages link to Approximating partially bounded degree deletion on directed graphs (Q1641092):
Displaying 4 items.
- On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (Q491619) (← links)
- A unified local ratio approximation of node-deletion problems (Q4595485) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Approximating power node-deletion problems (Q6057334) (← links)