A self-stabilizing algorithm for constructing weakly connected minimal dominating sets (Q989481)
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: A self-stabilizing algorithm for constructing weakly connected minimal dominating sets |
scientific article; zbMATH DE number 5773794
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A self-stabilizing algorithm for constructing weakly connected minimal dominating sets |
scientific article; zbMATH DE number 5773794 |
Statements
A self-stabilizing algorithm for constructing weakly connected minimal dominating sets (English)
0 references
20 August 2010
0 references
self-stabilizing algorithms
0 references
fault tolerance
0 references
distributed algorithms
0 references
graph algorithms
0 references
0 references
0.8991556167602539
0 references
0.8478999137878418
0 references
0.83686763048172
0 references
0.8300086855888367
0 references
