"A new distributed algorithm to find breadth first search trees."

Baruch Awerbuch, Robert G. Gallager (1987)

> Home

Details and statistics

DOI: 10.1109/TIT.1987.1057314

access: closed

type: Journal Article

metadata version: 2020-03-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tit/AwerbuchG87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/AwerbuchG87
Baruch Awerbuch, Robert G. Gallager:
A new distributed algorithm to find breadth first search trees. IEEE Trans. Inf. Theory 33(3): 315-322 (1987)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.