Efficient self-stabilizing algorithm for independent strong dominating sets in arbitrary graphs (Q3455752)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient self-stabilizing algorithm for independent strong dominating sets in arbitrary graphs |
scientific article; zbMATH DE number 6519912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient self-stabilizing algorithm for independent strong dominating sets in arbitrary graphs |
scientific article; zbMATH DE number 6519912 |
Statements
Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs (English)
0 references
11 December 2015
0 references
self-stabilization
0 references
independent strong dominating-set
0 references
weak domination
0 references
dominating set
0 references
independent set
0 references
distributed algorithm
0 references
fault-tolerance
0 references
0 references
0 references
0.8059855103492737
0 references
0.7814024090766907
0 references
0.7795047760009766
0 references
0.7736510634422302
0 references
0.7683796882629395
0 references
