dc.contributor.author | Amani, Mahdi | |
dc.contributor.author | Nowzari-Dalini, A | |
dc.date.accessioned | 2020-04-07T12:18:32Z | |
dc.date.available | 2020-04-07T12:18:32Z | |
dc.date.created | 2019-12-20T14:52:27Z | |
dc.date.issued | 2019 | |
dc.identifier.citation | Bulletin of the Iranian Mathematical Society. 2019, 45 (4), 1145-1158. | en_US |
dc.identifier.issn | 1018-6301 | |
dc.identifier.uri | https://hdl.handle.net/11250/2650660 | |
dc.description.abstract | In this paper, we present a new generation algorithm with corresponding ranking and unranking algorithms for (k, m)-ary trees in B-order. (k, m)-ary tree is introduced by Du and Liu. A (k, m)-ary tree is a generalization of k-ary tree, whose every node of even level of the tree has degree k and odd level of the tree has degree 0 or m. Up to our knowledge no generation, ranking or unranking algorithms are given in the literature for this family of trees. We use Zaks’ encoding for representing (k, m)-ary trees and to generate them in B-order. We also prove that, to generate (k, m)-ary trees in B-order using this encoding, the corresponding codewords should be generated in reverse-lexicographical ordering. The presented generation algorithm has a constant average time and O(n) time complexity in the worst case. Due to the given encoding, both ranking and unranking algorithms are also presented taking O(n) and | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Springer | en_US |
dc.title | Efficient Generation, Ranking, and Unranking of (k, m)-Ary Trees in B-Order | en_US |
dc.type | Peer reviewed | en_US |
dc.type | Journal article | en_US |
dc.description.version | acceptedVersion | en_US |
dc.source.pagenumber | 1145-1158 | en_US |
dc.source.volume | 45 | en_US |
dc.source.journal | Bulletin of the Iranian Mathematical Society | en_US |
dc.source.issue | 4 | en_US |
dc.identifier.doi | 10.1007/s41980-018-0190-y | |
dc.identifier.cristin | 1763451 | |
dc.description.localcode | "This is a post-peer-review, pre-copyedit version of an article. The final authenticated version is available online at: https://doi.org/10.1007/s41980-018-0190-y " | en_US |
cristin.unitcode | 194,63,35,0 | |
cristin.unitname | Institutt for elektroniske systemer | |
cristin.ispublished | true | |
cristin.fulltext | original | |
cristin.qualitycode | 1 | |