A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM

DOI10.1080/10637199408915459zbMath1049.68941OpenAlexW2044980003MaRDI QIDQ4820041

Pradip K. Srimani, Srinivasan Chandrasekhar

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199408915459

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items

SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE ⋮ Self-stabilizing algorithms for minimal dominating sets and maximal independent sets ⋮ A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees ⋮ An efficient fault-containing self-stabilizing algorithm for the shortest path problem ⋮ SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS ⋮ A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity ⋮ Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model ⋮ A self-stabilizing distributed algorithm to find the median of a tree graph ⋮ A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph ⋮ A self-stabilizing algorithm for the shortest path problem assuming the distributed demon

Cites Work

• Stabilizing unison
• A belated proof of self-stabilization
• An exercise in proving self-stabilization with a variant function
• Self-stabilizing systems in spite of distributed control