• DocumentCode
    2183310
  • Title

    Distributed BFS algorithms

  • Author

    Awerbuch, Baruch ; Gallager, Robert G.

  • fYear
    1985
  • fDate
    21-23 Oct. 1985
  • Firstpage
    250
  • Lastpage
    256
  • 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.
  • Keywords
    Asynchronous communication; Bandwidth; Complexity theory; Distributed algorithms; Interactive systems; Internet; Particle separators; Propagation delay; Video recording; Web sites;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1985., 26th Annual Symposium on
  • Conference_Location
    Portland, OR, USA
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-0644-4
  • Type

    conf

  • DOI
    10.1109/SFCS.1985.20
  • Filename
    4568148
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2183310