A new distributed algorithm to find breadth first search trees

DOI10.1109/TIT.1987.1057314MaRDI QIDQ3766873zbMATH OpenOpenAlexFDO

Authors Baruch Awerbuch, Robert G. Gallager

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

breadth first search treescommunication complexitycommunication networksdistributed algorithm

Mathematics Subject Classification ID

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

Cited in

(7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3766873)