A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity

DOI10.1016/J.JCSS.2004.12.011zbMATH Open1081.68004OpenAlexW2027189233MaRDI QIDQ2486565FDOQ2486565

Authors: Tetz C. Huang 

Publication date: 5 August 2005

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2004.12.011

Recommendations

• A self-stabilizing algorithm for the shortest path problem in a distributed system
• A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
• An efficient fault-containing self-stabilizing algorithm for the shortest path problem
• A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity
• Self-stabilization with \(r\)-operators

zbMATH Keywords

Self-stabilizing algorithmShortest pathModel of computationComposite read/write atomicitySeparate read/write atomicity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14)

Cites Work

• A self-stabilizing algorithm for constructing breadth-first trees
• Self-stabilization
• Self-stabilizing systems in spite of distributed control
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Title not available (Why is that?)
• A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM
• A self-stabilizing algorithm for the shortest path problem in a distributed system
• A belated proof of self-stabilization
• Self-Stabilizing Algorithms for Finding Centers and Medians of Trees

Cited In (6)

• An efficient fault-containing self-stabilizing algorithm for the shortest path problem
• A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
• Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model
• Quasi-self-stabilization of a distributed system assuming read/write atomicity
• A self-stabilizing algorithm for the shortest path problem in a distributed system
• A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity

This page was built for publication: A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486565)