Skip to search formSkip to main contentSkip to account menu

Connected dominating set

Known as: Maximum leaf spanning tree 
In graph theory, a connected dominated set and a maximum leaf spanning tree are two closely related structures defined on an undirected graph.
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
AlgorithmBidimensionalityDominating setGraph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2012
Review
2012
Connected Dominating Set: Theory and Applications
The connected dominating set has been a classic subject studied in graph theory since 1975. Since the 1990s, it has been found to… 
Review
2012
Review
2012
A Review of Information Dissemination Protocols for Vehicular Ad Hoc Networks
With the fast development in ad hoc wireless communications and vehicular technology, it is foreseeable that, in the near future… 
Review
2009
Review
2009
Connected Dominating Sets
Wireless sensor networks (WSNs), consist of small nodes with sensing, computation, and wireless communications capabilities, are… 
2008
2008
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
Many protocols in ad-hoc networks use dominating and connected dominating sets, for example for broadcasting and routing. For… 
Highly Cited
2007
Highly Cited
2007
Solving Connected Dominating Set Faster than 2n
Abstract In the connected dominating set problem we are given an n-node undirected graph, and we are asked to find a minimum… 
Highly Cited
2007
Highly Cited
2007
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
Since there is no fixed infrastructure or centralized management in wireless ad hoc networks, a Connected Dominating Set (CDS… 
Highly Cited
2004
Highly Cited
2004
Connected Dominating Set in Sensor Networks and MANETs
3 Centralized CDS Construction 335 3.1 Guha and Khuller’s Algorithm . . . . . . . . . . . . . . . . . . . . . 336 3.2 Ruan’s… 
Highly Cited
2003
Highly Cited
2003
Maximal Independent Set, Weakly-Connected Dominating Set, and Induced Spanners in Wireless Ad Hoc Networks
A maximal independent set (MIS) S for a graph G is an independent set and no proper superset of S is also independent. A set S is… 
Highly Cited
2002
Highly Cited
2002
Distributed heuristics for connected dominating sets in wireless ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V' of V, such that each node in V — V' is adjacent to some node… 
Highly Cited
2001
Highly Cited
2001
A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)