| UNION-FIND序列的计算时间 |
| |
| 引用本文： | 崔国华.UNION-FIND序列的计算时间[J].华中科技大学学报(自然科学版),1990(1). |
| |
| 作者姓名： | 崔国华 |
| |
| 作者单位： | 华中理工大学计算机科学与工程系 |
| |
| 摘 要： | 本文讨论了UNION-FIND算法,用一种比较简单的方法证明了W-UNION与C-FIND序列的计算时间是非线性的.
|
| 关 键 词： | 算法 计算时间 集合合并 集合查找 树 加权规则 压缩规则 |
On the Computing Time of UNION-FIND Sequence |
| |
| Cui Guohua.On the Computing Time of UNION-FIND Sequence[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,1990(1). |
| |
| Authors: | Cui Guohua |
| |
| Abstract: | The Set Union and the Set FIND algorithms are discussed. If both the weighting rule and collapsing rule are used, the computing time required by any sequence of the UNION and FIND algorithms is nonlinear.This paper gives a simple new method for proving this conclusion, which has so far remained very complicated.As some fairly satisfactory and nearly linear upper bounds of the computing time required by this sequence have been found, the proof described is a pretty good estimate for the computing time of this sequence. |
| |
| Keywords: | Algorithm Computing time Set UNION Set FIND Tree Weighting rule Collapsing rule |
| 本文献已被 CNKI 等数据库收录！ |
