Shortest route computation in distributed systems

DOI10.1016/S0305-0548(03)00111-4MaRDI QIDQ1885965zbMATH OpenFDO

Authors Jinchang Wang, Thomas Kämpke

Publication date 12 November 2004

Published in Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

Distributed computingShortest path problemLabeling algorithm

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• A self-stabilizing algorithm for the shortest path problem in a distributed system
• Another adaptive distributed shortest path algorithm
• Distributed distance computation and routing with small messages
• Computational Science – ICCS 2005
• An efficient fault-containing self-stabilizing algorithm for the shortest path problem

Cites work

• scientific article; zbMATH DE number 53892 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A note on two problems in connexion with graphs
• An algorithm for the ranking of shortest paths

Cited in

(3)

• scientific article; zbMATH DE number 1990700 (Why is no real title available?)
• An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages
• The fastest itinerary in time-dependent decentralized travel information systems

This page was built for publication: Shortest route computation in distributed systems

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