Memory efficient, self-stabilizing algorithm to construct BFS spanning trees

Authors:
Colette Johnen
Affiliations:
L.R.I./C.N.R.S. URA 410, Université Paris XI, Bat. 490, F-91405 Orsay Cedex, France
Venue:
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Year:
1997

Citing 0
Cited 3

Light enabling snap-stabilization of fundamental protocols

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Flat holonomies on automata networks

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Distributed maintenance of a spanning tree using labeled tree encoding

Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract