有向最小权值生成树的分布式算法

IF 1.3 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Distributed Computing Pub Date : 2021-06-29 DOI:10.1007/s00446-021-00398-3

O. Fischer, R. Oshman

引用次数: 12

摘要

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

查看原文本刊更多论文

A distributed algorithm for directed minimum-weight spanning tree

求助全文

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

来源期刊

Distributed Computing 工程技术-计算机：理论方法

CiteScore

3.20

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The international journal Distributed Computing provides a forum for original and significant contributions to the theory, design, specification and implementation of distributed systems. Topics covered by the journal include but are not limited to: design and analysis of distributed algorithms; multiprocessor and multi-core architectures and algorithms; synchronization protocols and concurrent programming; distributed operating systems and middleware; fault-tolerance, reliability and availability; architectures and protocols for communication networks and peer-to-peer systems; security in distributed computing, cryptographic protocols; mobile, sensor, and ad hoc networks; internet applications; concurrency theory; specification, semantics, verification, and testing of distributed systems. In general, only original papers will be considered. By virtue of submitting a manuscript to the journal, the authors attest that it has not been published or submitted simultaneously for publication elsewhere. However, papers previously presented in conference proceedings may be submitted in enhanced form. If a paper has appeared previously, in any form, the authors must clearly indicate this and provide an account of the differences between the previously appeared form and the submission.