A self-stabilizing algorithm for the shortest path problem in a distributed system
From MaRDI portal
Publication:1609042
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
Cites work
Cited in
(9)- Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model
- A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
- Self-stabilizing disconnected components detection and rooted shortest-path tree maintenance in polynomial steps
- A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity
- Efficient transformation of distance-2 self-stabilizing algorithms
- scientific article; zbMATH DE number 2061548 (Why is no real title available?)
- Self-stabilizing disconnected components detection and rooted shortest-path tree maintenance in polynomial steps
- Shortest route computation in distributed systems
- An efficient fault-containing self-stabilizing algorithm for the shortest path problem
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)