Pages that link to "Item:Q3557006"
From MaRDI portal
The following pages link to Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set (Q3557006):
Displayed 9 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)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- A linear kernel for planar red-blue dominating set (Q516887) (← links)
- A linear kernel for a planar connected dominating set (Q534569) (← links)
- An Improved Kernel for Planar Connected Dominating Set (Q3010387) (← links)
- Smaller Kernels for Several FPT Problems Based on Simple Observations (Q3452562) (← links)