.png){kind=icon}
返回
A SIMPLE OPTIMAL PARALLEL ALGORITHM FOR A CORE OF A TREE
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1994.1035.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A core of a tree T = (V, E) is a path in T which minimizes SIGMA(v is-an-element-of V) d(v, P), where d(v, P), the distance from a vertex v to path P, is defined as min(u is-an-element-of p) d(v, u). We present an optimal parallel algorithm to find a core of T in O(log n) time using O(n/log n) processors on an EREW PRAM machine, where n is the number of vertices of tree T. (C) 1994 Academic Press, Inc.
Keyword:
NETWORK
LOCATION
