Dominating Sets
A Dominating Set is a subset of vertices in a graph such that every vertex not in the subset is adjacent to at least one vertex in the subset, distinguishing it from other vertex subsets by its property of dominating all vertices in the graph.
1.5K
Publications
67.7K
Citations
2.3K
Authors
958
Institutions
Publications per year
2017–2026
261
Parents
1.5K
On calculating connected dominating set for efficient routing in ad hoc wireless networks
Approximation Algorithms for Connected Dominating Sets
Suvajyoti Guha, Samir Khuller · Algorithmica · 1998 · 1.1K citations
E. J. Cockayne, Robyn M. Dawes, Stephen T. Hedetniemi · Networks · 1980 · 690 citations
1–5 of 1.5K
2.3K
34
h-index
21
h-index
21
h-index
20
h-index
18
h-index
1–5 of 2.3K
958

University of KwaZulu-Natal
Durban, South Africa
28 h-index
67 publications
2.6K citations
The University of Texas at Dallas
Richardson, United States
28 h-index
91 publications
5.2K citations

University of Johannesburg
Johannesburg, South Africa
25 h-index
117 publications
3.1K citations
Florida Atlantic University
Boca Raton, United States
23 h-index
54 publications
7.7K citations
Clemson University
Clemson, United States
22 h-index
68 publications
2.9K citations

Illinois Institute of Technology
Chicago, United States
21 h-index
51 publications
8.9K citations
Georgia State University
Atlanta, United States
21 h-index
55 publications
2.5K citations
RWTH Aachen University
Aachen, Germany
19 h-index
46 publications
1.2K citations
1–8 of 958
145 publications · 5K citations
37
h-index
99 publications · 3.8K citations
32
h-index
43 publications · 1.7K citations
23
h-index
38 publications · 2.1K citations
23
h-index
DMGT · 44 publications · 1.2K citations
22
h-index
1–5