Fast Generation of t-ary Trees

This paper presents new algorithms for generating all n-node t-ary trees in linked representation which take constant average time per tree. They use fewer memory references and are considerably faster than previous such algorithms. [PUBLICATION ABSTRACT]

Saved in:
Bibliographic Details
Published in:Computer journal 2011-05, Vol.54 (5), p.776-785
Main Author: Korsh, J. F.
Format: Article
Language:English
Subjects:
Algorithms
Binary system
Computer science
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents new algorithms for generating all n-node t-ary trees in linked representation which take constant average time per tree. They use fewer memory references and are considerably faster than previous such algorithms. [PUBLICATION ABSTRACT]
ISSN:0010-4620
1460-2067
DOI:10.1093/comjnl/bxq025