.png){kind=icon}
返回
A dynamic self-stabilizing algorithm for constructing a transport net
.png){kind=icon}
PRE
AI
DOI：10.1007/s00607-001-1436-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
biconnected graph
distributed systems
self-stabilization
transport net
