A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon (Q2015142)
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 4n-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon |
scientific article; zbMATH DE number 6306361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon |
scientific article; zbMATH DE number 6306361 |
Statements
A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon (English)
0 references
23 June 2014
0 references
self-stabilizing algorithm
0 references
fault tolerance
0 references
distributed computing
0 references
graph algorithm
0 references
domination
0 references
0 references
0.9320829510688782
0 references
0.8381908535957336
0 references
0.8253271579742432
0 references
0.8117435574531555
0 references
0.8089619278907776
0 references
