分布式BFS算法

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) Pub Date : 1985-10-21 DOI:10.1109/SFCS.1985.20

B. Awerbuch, R. Gallager

{"title":"分布式BFS算法","authors":"B. Awerbuch, R. Gallager","doi":"10.1109/SFCS.1985.20","DOIUrl":null,"url":null,"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.","PeriodicalId":296739,"journal":{"name":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1985-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"54","resultStr":"{\"title\":\"Distributed BFS algorithms\",\"authors\":\"B. Awerbuch, R. Gallager\",\"doi\":\"10.1109/SFCS.1985.20\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":296739,\"journal\":{\"name\":\"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"54\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1985.20\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1985.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 54

摘要

针对异步通信网络，提出了一种新的分布式BFS算法。本文提出了两种新的BFS算法，提高了通信复杂度。第一种算法的通信复杂度为O((E+V1.5)¿logV)，时间复杂度为O(V1.5¿logV)。第二种算法采用了第一种算法的递归技术，实现了通信0 (E¿2√logVloglogV)和时间0 (V¿2√logVloglogV)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Distributed BFS algorithms

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

26th Annual Symposium on Foundations of Computer Science (sfcs 1985)

自引率

0.00%

发文量