Limit Theorems for the Cost of Splitting Random Cayley Trees
碩士 === 國立交通大學 === 應用數學系所 === 100 === In computer science, the so-called "Union-Find problem" is concerned with establishing a data structure for maintaining a collection of disjoint sets such that the process of merging sets can be carried out efficiently. Indeed, several data structures a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/24068832006181372227 |