A new distributed algorithm to find breadth first search trees

DOI10.1109/TIT.1987.1057314zbMath0629.68070OpenAlexW2059015573MaRDI QIDQ3766873

Robert G. Gallager, Baruch Awerbuch

Publication date: 1987

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1987.1057314

zbMATH Keywords

communication networkscommunication complexitydistributed algorithmbreadth first search trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (7)

Efficient distributed algorithms for single-source shortest paths and related problems on plane networks ⋮ A distributed shortest path algorithm for a planar network ⋮ Distributed computation of coverage in sensor networks by homological methods ⋮ Distributed balanced color assignment on arbitrary networks ⋮ An efficient distributed algorithm for finding all hinge vertices in networks ⋮ Piecemeal graph exploration by a mobile robot. ⋮ Graph theoretical issues in computer networks

This page was built for publication: A new distributed algorithm to find breadth first search trees