.png){kind=icon}
返回
A parallel algorithm for optimum height-limited alphabetic binary trees
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1996.0067.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, an O(L log n)-time n-processor parallel EREW PRAM algorithm is presented for construction of an optimal alphabetic binary tree with height restricted to L. The technique used is parallel package merge. (C) 1996 Academic Press, Inc.
