摘要: We present a modified union-find algorithm that represent the data in an array rather than the commonly used pointer-based data structures, and a simpler proof that the average case complexity of the union-find algorithm is linear.
| 作者 | Wu, K. | ||
|---|---|---|---|
| 原报告号 | DE2006877676 | 总页数 | 10 |
| 报告类别/文献类型 | DE / NTIS科技报告 | ||
| 关键词 | Algorithms Calculation methods Data analysis Arrays Data representation Proofs Linear Path compression Problem solving Union-find problem Average case complexity Pointer machines | ||
