Distributed BFS algorithms

Authors:
Baruch Awerbuch;Robert G. Gallager
Affiliations:
-;-
Venue:
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Year:
1985

Citing 0
Cited 4

Applying static network protocols to dynamic networks

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Light enabling snap-stabilization of fundamental protocols

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Near-optimal multicriteria spanner constructions in wireless ad hoc networks

IEEE/ACM Transactions on Networking (TON)
Efficient distributed breadth-first search algorithm

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper develops a new distributed BFS algorithm for an asynchronous communication network. This paper presents two new BFS algorithms with improved communication complexity. The first algorithm has complexity O((E+V1.5)ċlogV) in communication and O(V1.5ċlogV) in time. The second algorithm uses the technique of the first recursively and achieves O(Eċ2 √logVloglogV) in communication and O(Vċ2√logVloglogV) in time.