Pages that link to "Item:Q1675919"
From MaRDI portal
The following pages link to Tight approximation bounds for dominating set on graphs of bounded arboricity (Q1675919):
Displaying 6 items.
- Greedy domination on biclique-free graphs (Q1730031) (← links)
- An improved approximation bound for minimum weight dominating set on graphs of bounded arboricity (Q2085734) (← links)
- Local planar domination revisited (Q2097345) (← links)
- Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
- On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936) (← links)
- A Constructive Arboricity Approximation Scheme (Q3297754) (← links)
