Algorithms for generating and coding B-Trees.
Gupta, Lee and Wong described algorithms for generating 2-3 trees and B-trees with a given number of nodes and left as open problems whether algorithms exist that generate them in lexicographic order, and whether it is possible to generate 2-3 trees (GLW) or B-Trees (GLW1) in constant average delay,...
Main Author: | Belbaraka, Mounir. |
---|---|
Other Authors: | Stojmenovic, I. |
Format: | Others |
Published: |
University of Ottawa (Canada)
2009
|
Subjects: | |
Online Access: | http://hdl.handle.net/10393/9826 http://dx.doi.org/10.20381/ruor-16523 |
Similar Items
-
AN APPROACH TO THE AUTOMATIC GENERATION OF CODE-GENERATORS
by: DONEGAN, MICHAEL KELLY
Published: (2007) -
Automatic model - based test case generation for uml diagrams using tree travelsal algorithm
by: Oluwatolani, Oluwagbemi
Published: (2016) -
Integrated Code Generation
by: Eriksson, Mattias
Published: (2011) -
Tree-Searching Algorithms on Parallel Architectures
by: Mebrotra, Mala
Published: (1985) -
Parallel Junction Tree Algorithm on GPU
by: Zheng, Lu
Published: (2013)