A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity

DOI10.1016/j.camwa.2004.01.014zbMath1075.68064MaRDI QIDQ1779602

Ji-Cherng Lin, Nathan Mou, Tetz C. Huang

Publication date: 1 June 2005

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2004.01.014

zbMATH Keywords

Self-stabilizing algorithm; Center; Model of computation; Interleaving model; Read/write separate atomicity

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

68M14: Distributed systems

Related Items

Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model, Quasi-self-stabilization of a distributed system assuming read/write atomicity, Modeling self-assembly and capture phenomenon of two droplets in high aspect ratio microchannels

Cites Work

• A belated proof of self-stabilization
• Self-stabilization of dynamic systems assuming only read/write atomicity
• A self-stabilizing algorithm which finds a 2-center of a tree
• Self-stabilizing systems in spite of distributed control
• Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item