Pages that link to "Item:Q4595486"
From MaRDI portal
The following pages link to Approximation algorithms for connected dominating sets (Q4595486):
Displaying 6 items.
- Approximation hardness of dominating set problems in bounded degree graphs (Q958303) (← links)
- An exact algorithm for the maximum leaf spanning tree problem. (Q1413822) (← links)
- Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
- Leafy spanning \(k\)-forests (Q2165258) (← links)
- Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (Q2839214) (← links)
- The maximum-leaf spanning tree problem: Formulations and facets (Q4474303) (← links)
