Pages that link to "Item:Q3630213"
From MaRDI portal
The following pages link to Linear Kernel for Planar Connected Dominating Set (Q3630213):
Displaying 14 items.
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- Planar graph vertex partition for linear problem kernels (Q355502) (← links)
- Improved linear problem kernel for planar connected dominating set (Q392013) (← links)
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- A linear kernel for planar red-blue dominating set (Q516887) (← links)
- A linear kernel for a planar connected dominating set (Q534569) (← links)
- On parameterized independent feedback vertex set (Q690464) (← links)
- An Improved Kernel for Planar Connected Dominating Set (Q3010387) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Polynomial-time data reduction for dominating set (Q3583575) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)