Memory Efficient, Self-Stabilizing Algorithm to Construct BFS Spanning Trees

@inproceedings{Johnen1997MemoryES,
  title={Memory Efficient, Self-Stabilizing Algorithm to Construct BFS Spanning Trees},
  author={Colette Johnen},
  booktitle={PODC},
  year={1997}
}
The spanning tree construction is a fundamental task in communication networks. Improving the efficiency of the underlying spanning tree algorithm usually also corresponds to the improvement of the efficiency of the entire system. One of the important performance issues of selfstabilizing algorithms is the memory requirement per processor. The self-stabilizingspanning-tree algorithms to-date need a distance variable, which keeps track of the current level of the processor in the BFS tree. Thus… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS
16 Citations
0 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

Similar Papers

Loading similar papers…