Pages that link to "Item:Q5234662"
From MaRDI portal
The following pages link to Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662):
Displaying 8 items.
- 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)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)
- Distributed domination on sparse graph classes (Q6614403) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)
