Generation of rooted trees and free trees

Simple item page
dc.contributor.authorLi, Gangen_US
dc.date.accessioned2024-08-14T21:03:35Z
dc.date.available2024-08-14T21:03:35Z
dc.date.copyright1996en_US
dc.date.issued1996
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractIn this thesis we present two new recursive algorithms for generating unlabeled rooted trees and unlabeled free trees . We first simplify Beyer-Hedetniemi's [5] iter­ative algorithm for generating rooted trees by using the more natural parent array representation. We then develop a new recursive algorithm which is much simpler, more flexible and easier to analyze. With some simple modifications, our algorithm will generate rooted trees of size n with height lying in a given range and/or with the number of children of each node bounded by a given integer. Our recursive al­gorithm for generating rooted trees is then extended to generate free trees . We also show how to make some simple modifications to generate free trees with some height constraints and/or with a degree restriction. Both algorithms and their modifications run in constant amortized time which is the best possible.
dc.format.extent82 pages
dc.identifier.urihttps://hdl.handle.net/1828/18651
dc.rightsAvailable to the World Wide Weben_US
dc.titleGeneration of rooted trees and free treesen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
LI_Gang_MSC_1996_697906.pdf
Size:
20.49 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.