Pages that link to "Item:Q3583575"
From MaRDI portal
The following pages link to Polynomial-time data reduction for dominating set (Q3583575):
Displaying 5 items.
- Subexponential parameterized algorithms (Q458457) (← links)
- Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← links)
- A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850) (← links)
