.png){kind=icon}
返回
A self-stabilizing leader election algorithm for tree graphs
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1996.0059.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a self-stabilizing algorithm (protocol) for leader election in a tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction. (C) 1996 Academic Press Inc.
Keyword:
SYSTEMS
RINGS
