Ordered tree generation algorithms

Simple item page
dc.contributor.authorRoelants van Baronaigien, Dominiqueen_US
dc.date.accessioned2024-08-15T17:42:09Z
dc.date.available2024-08-15T17:42:09Z
dc.date.copyright1986en_US
dc.date.issued1986
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractAlgorithms have been created for generating all binary trees with n nodes, all k-ary trees with n nodes all ordered trees with n nodes, and all ordered trees with a particular degree sequence A survey of these ordered tree generation algorithms is presented here. Two natural orderings [25] are described for listing k-ary trees These orderings are called A-order and B-order Many algorithms already exist for generatmg k -ary trees m B-order, but no algorithm exists for generating k­-ary trees in A-order. This thesis provides an algorithm for generating k-ary trees in A-order. The algorithm is shown to be, on average, constant time per tree generated for k =2. The thesis also provides the ranking and unranking algorithms associated with A-order.
dc.format.extent82 pages
dc.identifier.urihttps://hdl.handle.net/1828/19546
dc.rightsAvailable to the World Wide Weben_US
dc.titleOrdered tree generation algorithmsen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ROELANTS_VAN_BARONAIGIEN_Dominique_MSc_1986_92065.pdf
Size:
17.21 MB
Format:
Adobe Portable Document Format
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.