logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A dynamic self-stabilizing algorithm for constructing a transport net

delete2002-03-01
delete10
PRE
AI
M
Mehmet Hakan Karaata
P
P.P. Chaudhuri
DOI：10.1007/s00607-001-1436-7delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
A self-stabilizing algorithm is presented in this paper that constructs a transport net corresponding to an undirected biconnected graph on a distributed or network model of computation. The algorithm is resilient to transient faults and does not require initialization. In addition, it is capable of handling topology changes in a transient manner. The paper includes a correctness proof of the algorithm. Finally, it concludes with some final remarks.
Keywords:
biconnected graph
distributed systems
self-stabilization
transport net

Journal

C
Computing
IF:
2.8
Papers:
2.3K
Citations:
3.5K

Organization

No organization information available
Cited Papers

Cited Papers

No cited papers available