.png){kind=icon}
返回
A distributed algorithm for constructing a minimum diameter spanning tree
.png){kind=icon}
OA
AI
DOI：10.1016/j.jpdc.2004.03.009.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (non-negatively) real-weighted graph G = (V, E, (omega)). As an intermediate step, we use a new, fast, linear-time all-pairs shortest paths distributed algorithm to find an absolute centre of G. The resulting distributed algorithm is asynchronous, it works for named asynchronous arbitrary networks and achieves O(\V\) time complexity and O(\V\ \E\) message complexity. (C) 2004 Elsevier Inc. All rights reserved.
Keyword:
spanning trees
minimum diameter spanning trees
shortest paths
shortest paths trees
all-pairs shortest paths
absolute centres
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
Effect of Intervertebral Disc Height on Postoperative Motion and Outcomes After ProDisc-L Lumbar Disc Replacement.png)
Spine
SpineIF0
PREAI
分享收藏
Gap Junctional Intercellular Communication and Cell Proliferation during Rat Liver CarcinogenesisOAAI
OAAI分享收藏 没有更多内容
没有更多内容