Back to Search
Start Over
Fast Generation of t-ary Trees.
- Source :
-
Computer Journal . May2011, Vol. 54 Issue 5, p776-785. 10p. - Publication Year :
- 2011
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00104620
- Volume :
- 54
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- Computer Journal
- Publication Type :
- Academic Journal
- Accession number :
- 60548232
- Full Text :
- https://doi.org/10.1093/comjnl/bxq025