A self-stabilizing distributed algorithm to find the median of a tree graph (Q1305938): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Token systems that self-stabilize / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing depth-first search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM / 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: Parallel concepts in graph theory / 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: Q4325545 / rank
 
Normal rank

Latest revision as of 08:19, 29 May 2024

scientific article
Language Label Description Also known as
English
A self-stabilizing distributed algorithm to find the median of a tree graph
scientific article

    Statements

    Identifiers