A self-stabilizing algorithm for constructing breadth-first trees (Q1186586): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Token systems that self-stabilize / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A self-stabilizing algorithm for constructing spanning trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Self-stabilizing systems in spite of distributed control / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A belated proof of self-stabilization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An exercise in proving self-stabilization with a variant function / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Self-stabilization (in spite of distributed control) in tree-structured systems / rank | |||
Normal rank | |||
Revision as of 16:06, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A self-stabilizing algorithm for constructing breadth-first trees |
scientific article |
Statements
A self-stabilizing algorithm for constructing breadth-first trees (English)
0 references
28 June 1992
0 references
fault tolerance
0 references
distributed system
0 references
error recovery
0 references
self-stabilizing algorithm
0 references
breadth-first trees
0 references
