.png){kind=icon}
.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
spanning trees
minimum diameter spanning trees
shortest paths
shortest paths trees
all-pairs shortest paths
absolute centres
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available