Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization

Published:1985 Issue:4 Volume:15 Page:425-437
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Awerbuch Baruch

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference9 articles.

1. Complexity of Network Synchronization, Journal of the ACM, October 1985.

2. Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation

3. Graph Algorithms. Computer Science Press, 1979.

4. Parallel processing using depth-search and breadth-first search. Ph. D. Thesis, University of Iowa, Iowa City, 1977.

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Inefficiencies in network models: A graph-theoretic perspective;Information Processing Letters;2018-03

2. Near-Optimal Distributed Maximum Flow;SIAM Journal on Computing;2018-01

3. SilentWhispers: Enforcing Security and Privacy in Decentralized Credit Networks;Proceedings 2017 Network and Distributed System Security Symposium;2017

4. Near-Optimal Distributed Maximum Flow;Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing;2015-07-21

5. A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks;Physica A: Statistical Mechanics and its Applications;2013-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP