A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH (Q3130163): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Self-stabilizing depth-first search / 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: Stabilizing unison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unifying self-stabilization and fault-tolerance / 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-stabilizing extensions for message-passing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings / rank
 
Normal rank

Latest revision as of 12:17, 27 May 2024

scientific article
Language Label Description Also known as
English
A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH
scientific article

    Statements