2013 IEEE/ACM 17th International Symposium on Distributed Simulation and Real Time Applications 2013
DOI: 10.1109/ds-rt.2013.33
|View full text |Cite
|
Sign up to set email alerts
|

Self-Stabilizing Algorithm for Low Weight Connected Dominating Set

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 18 publications
0
1
0
Order By: Relevance
“…The first self-stabilizing algorithm for (minimal) dominating set was proposed by Hedetniemi et al [9]. After that, many variants of self-stabilising algorithms have been proposed imposing additional parameters of domination like total domination [10,11], efficient domination [12,13], connected dominating set [14,15], influence domination [16,17], distance-k domination [18]. Each parameter has its benefits according to the used application.…”
Section: Introductionmentioning
confidence: 99%
“…The first self-stabilizing algorithm for (minimal) dominating set was proposed by Hedetniemi et al [9]. After that, many variants of self-stabilising algorithms have been proposed imposing additional parameters of domination like total domination [10,11], efficient domination [12,13], connected dominating set [14,15], influence domination [16,17], distance-k domination [18]. Each parameter has its benefits according to the used application.…”
Section: Introductionmentioning
confidence: 99%