The connected domination number of grids

DOI10.1007/978-3-030-67899-9_19OpenAlexW3128672286MaRDI QIDQ831725FDOQ831725

N. S. Narayanaswamy, Adarsh Srinivasan

Publication date: 24 March 2022

Full work available at URL: https://arxiv.org/abs/2011.11328

zbMATH Keywords

maximum leaf spanning treeconnected dominating setgrid graphconnected domination number

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Title not available (Why is that?)
• Unit disk graphs
• A short note on the approximability of the maximum leaves spanning tree problem
• Title not available (Why is that?)
• Planar Formulae and Their Uses
• Approximating Maximum Leaf Spanning Trees in Almost Linear Time
• The Domination Number of Grids
• An exact algorithm for the maximum leaf spanning tree problem.
• NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
• Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks
• A 2-approximation algorithm for finding a spanning tree with maximum number of leaves
• Variations of the maximum leaf spanning tree problem for bipartite graphs

Cited In (2)

• The biclique covering number of grids
• The Connected Domination Number of Grids

This page was built for publication: The connected domination number of grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831725)