A self-stabilizing algorithm for constructing breadth-first trees
Authors:
- Shing-Tsaan HuangSHShing-Tsaan Huang
- Nian-Shing ChenNCNian-Shing Chen
- 1 February 1992
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 41 (2) , 109-117
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A self-stabilizing algorithm for constructing spanning treesInformation Processing Letters, 1991
- Self-stabilization of dynamic systems assuming only read/write atomicity1990
- Token systems that self-stabilizeIEEE Transactions on Computers, 1989
- Uniform self-stabilizing ringsACM Transactions on Programming Languages and Systems, 1989
- An exercise in proving self-stabilization with a variant functionInformation Processing Letters, 1988
- A belated proof of self-stabilizationDistributed Computing, 1986
- 1983 Invited address solved problems, unsolved problems and non-problems in concurrency1984
- Self-stabilization (in spite of distributed control) in tree-structured systemsInformation Processing Letters, 1979
- Self-stabilizing systems in spite of distributed controlCommunications of the ACM, 1974