Advance Access published on March 7, 2006 doi10.1093comjnlbxk003 Skarbek’s Algorithm for t.pdf

下载文档

0
0
约2.11万字
约 7页
2017-04-09 发布于江苏
举报
版权申诉
保障服务

Advance Access published on March 7, 2006 doi10.1093comjnlbxk003 Skarbek’s Algorithm for t.pdf

1、本文档共7页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

Advance Access published on March 7, 2006 doi10.1093comjnlbxk003 Skarbek’s Algorithm for t

Skarbek’s Algorithm for t-Ary Trees James F. Korsh Department of Computer and Information Sciences, Temple University, Philadelphia, PA, USA Corresponding author: korsh@ This paper presents a new algorithm for generating all n node t-ary trees in linked representation by providing a context and generalizing Skarbek’s algorithm for generating binary trees. It initially appeared that Skarbek’s algorithm could not be generalized to even 3-ary trees, which motivated the author to previously develop an algorithm for generating all n node t-ary trees in linked representation based on a particular listing of integer sequences representing the trees. The context for the generalization of Skarbek’s algorithm turns out to also be a particular listing of integer sequences representing the trees. The paper also gives two constant average time implementations. The first generates the next tree from its predecessor given in linked representation while the second retains additional information about the predecessor beyond just its linked representation. Keywords: combinatorial generation, t-ary trees, constant average time Received 8 October 2005; revised 5 January 2006 1. INTRODUCTION Many algorithms [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27] exist for generating binary or t-ary trees represented by sequences of integers but few [28, 29, 30, 31, 32, 33] use linked representation. Only two of them generate the next tree directly from its predecessor. One is the adaptation of Skarbek’s [34] algorithm for generating all n node ordered trees to the generation of n node binary trees by Knuth [32], who showed the adaptation asymptotically required only 8 2/3 10/3n + O(n2) memory references per tree generated, and posed the problem of generalizing it to 3-ary trees. The other is the algorithm by Korsh [33], which was motivated by the absence of any immediate generalization for Skarbek’s algorithm, and is based on a particular li