Loading...
Please wait, while we are loading the content...
Similar Documents
Ranking and Unranking Algorithms for k-ary Trees in Gray Code Order
| Content Provider | Semantic Scholar |
|---|---|
| Author | Ashari-Ghomi, Fateme Khorasani, Najme Nowzari-Dalini, Abbas |
| Copyright Year | 2012 |
| Abstract | In this paper, we present two new ranking and unranking algorithms for k-ary trees represented by x-sequences in Gray code order. These algorithms are based on a gray code generation algorithm developed by Ahrabian et al.. In mentioned paper, a recursive backtracking generation algorithm for x-sequences corresponding to k-ary trees in Gray code was presented. This generation algorithm is based on Vajnovszki’s algorithm for generating binary trees in Gray code ordering. Up to our knowledge no ranking and unranking algorithms were given for x-sequences in this ordering. we present ranking and unranking algorithms with O(kn) time complexity for x-sequences in this Gray code ordering . Keywords—k-ary Tree Generation, Ranking, Unranking, Gray Code. |
| Starting Page | 1020 |
| Ending Page | 1025 |
| Page Count | 6 |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://waset.org/publications/9384/ranking-and-unranking-algorithms-for-k-ary-trees-in-gray-code-order |
| Volume Number | 6 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
