Pages that link to "Item:Q4575843"
From MaRDI portal
The following pages link to Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes (Q4575843):
Displaying 14 items.
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs (Q2662795) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
- Coloring and Covering Nowhere Dense Graphs (Q4553722) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- (Q5090497) (← links)
- Neighborhood complexity and kernelization for nowhere dense classes of graphs (Q5111394) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness (Q5140724) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- (Q6089671) (← links)
- On finding short reconfiguration sequences between independent sets (Q6627042) (← links)