Distributed BFS algorithms

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.