An efficient fault-containing self-stabilizing algorithm for the shortest path problem

ISSN： 0178-2770

Source： Distributed Computing, Vol.19, Iss.2, 2006-10, pp. : 149-161

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Fault-containing self-stabilizing distributed protocols

By Ghosh Sukumar Gupta Arobinda Herman Ted Pemmaraju Sriram

Distributed Computing, Vol. 20, Iss. 1, 2007-07 ,pp. : 53-73

Springer Publishing Company

Access to resources Recommend Favorite

A Self-Stabilizing Leader Election Algorithm for Tree Graphs

By Antonoiu G. Srimani P.K.

Journal of Parallel and Distributed Computing, Vol. 34, Iss. 2, 1996-05 ,pp. : 227-232

Academic Press

Access to resources Recommend Favorite

A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs

By Träff J.L. Zaroliagis C.D.

Journal of Parallel and Distributed Computing, Vol. 60, Iss. 9, 2000-09 ,pp. : 1103-1124

Academic Press

Access to resources Recommend Favorite

A Quorum-Based Self-Stabilizing Distributed Mutual Exclusion Algorithm

By Nesterenko M. Mizuno M.

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 2, 2002-02 ,pp. : 284-305

Academic Press

Access to resources Recommend Favorite

Space and Time Efficient Self-Stabilizing ℓ-Exclusion in Tree Networks

By Hadid R.

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 5, 2002-05 ,pp. : 843-864

Academic Press

Access to resources Recommend Favorite