A self-stabilizing algorithm for the shortest path problem in a distributed system
From MaRDI portal
Publication:1609042
DOI10.1016/S0898-1221(01)00276-0zbMATH Open1002.68013MaRDI QIDQ1609042FDOQ1609042
Authors: Tetz C. Huang, Ji-Cherng Lin 
Publication date: 15 August 2002
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Recommendations
- A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
- A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity
- An efficient fault-containing self-stabilizing algorithm for the shortest path problem
- Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model
- Another adaptive distributed shortest path algorithm
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)
Cites Work
Cited In (9)
- Efficient transformation of distance-2 self-stabilizing algorithms
- Title not available (Why is that?)
- An efficient fault-containing self-stabilizing algorithm for the shortest path problem
- Self-stabilizing disconnected components detection and rooted shortest-path tree maintenance in polynomial steps
- Shortest route computation in distributed systems
- A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
- 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
- Self-stabilizing disconnected components detection and rooted shortest-path tree maintenance in polynomial steps
This page was built for publication: A self-stabilizing algorithm for the shortest path problem in a distributed system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1609042)
