Distributed BFS algorithms

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 01 Oct 1985Publisher:IEEEJournal:26th Annual Symposium on Foundations of Computer Science (sfcs 1985)

Authors: Baruch Awerbuch; Robert G. Gallager;

doi: 10.1109/sfcs.1985.20

Distributed BFS algorithms

- Summary
- Metrics

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.

Related Organizations

Massachusetts Institute of Technology
United States

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	28
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average