Dominating set

Known as: Domination perfect graph, Domination, Independent domination number 
In graph theory, a dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is adjacent to at least one member of D… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Multi-document summarization has been an important problem in information retrieval. It aims to distill the most important… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We propose a notion of an extended dominating set where each node in an ad hoc network is covered by either a dominating neighbor… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
  • Fei Dai, Jie Wu
  • 19th IEEE International Parallel and Distributed…
  • 2005
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in… (More)
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We design fast exact algorithms for the problem of computing a minimum dominating set in undirected graphs. Since this problem is… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We provide simple, faster algorithms for the detection of cliques and dominating sets of $xed order. Our algorithms are based on… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Dominating sets have many applications in distributed computing, and especially in ad-hoc radio networks. One way they are used… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Our paper [1] generated a lot of interest among researchers in ad hoc networks. A number of researchers questioned, through their… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The dominating set problem asks for a small subset D of nodes in a graph such that every node is either in D or adjacent to a… (More)
Is this relevant?