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