A self-stabilizing algorithm for constructing breadth-first trees (Q1186586): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(92)90264-v / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085991314 / rank
 
Normal rank

Latest revision as of 10:31, 30 July 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
    0 references
    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

    Identifiers