Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs

Self-stabilizing systems in spite of distributed control

Edsger W. Dijkstra · Communications of the ACM · 1974 · 2.1K citations · Full text

Computing, Computer Science, Computer Systems +17

On calculating connected dominating set for efficient routing in ad hoc wireless networks

Jie Wu, Hailan Li · 1999 · 1.2K citations · Full text

Computing, Computer Science, Algorithms +16

Routing in ad-hoc networks using minimum connected dominating sets

Bevan Das, V. Bharghavan · 2002 · 771 citations

Computing, Computer Science, Computer Networks +16

Total domination in graphs

E. J. Cockayne, Robyn M. Dawes, Stephen T. Hedetniemi · Networks · 1980 · 690 citations

Natural Sciences, Mathematics, Combinatorics +9

A survey of selected recent results on total domination in graphs

Michael A. Henning · Discrete Mathematics · 2008 · 305 citations

Natural Sciences, Mathematics, Combinatorics +11