arrow
Return

A self-stabilizing leader election algorithm for tree graphs

delete1996-05-01
delete24
PRE
AI
A
Antonoiu, G
S
Srimani, PK
DOI:10.1006/jpdc.1996.0059delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

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.
Keywords:
SYSTEMS
RINGS

Journal

Journal of Parallel and Distributed Computing cover
Journal of Parallel and Distributed Computing
IF:
4
Papers:
3.8K
Citations:
4.8K

Organization

No organization information available
Cited Papers

Cited Papers

No cited papers available