×

On the relationship between son-trees and symmetric binary B-trees. (English) Zbl 0422.68029


MSC:

68R10 Graph theory (including graph drawing) in computer science
68P05 Data structures
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Aho, V. A.; Hopcroft, J. E.; Ullman, J. D., The Design and Analysis of Computer Algorithms (1974), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0326.68005
[2] Bayer, R., Symmetric binary B-trees: data structure and maintenance algorithms, Acta Informat., 1, 290-306 (1972) · Zbl 0233.68009
[3] Knuth, D. E., Fundamental Algorithms, (The Art of Computer Programming, Vol. 1 (1973), Addison-Wesley: Addison-Wesley Reading, MA) · Zbl 0191.17903
[4] Knuth, D. E., Sorting and Searching, (The Art of Computer Programming, Vol. 3 (1973), Addison-Wesley: Addison-Wesley Reading, MA) · Zbl 0777.68012
[5] H. Olivié and J. Paredaens, On the relationship between son-trees and symmetric binary B-trees, Report 79-24, Department of Mathematics, University of Antwerp, Belgium.; H. Olivié and J. Paredaens, On the relationship between son-trees and symmetric binary B-trees, Report 79-24, Department of Mathematics, University of Antwerp, Belgium.
[6] Ottmann, Th.; Six, H.-W., Eine neue Klasse von ausge-glichenen Binärbäumen, Angewandte Informatik, 9, 395-400 (1976) · Zbl 0331.68023
[7] Ottmann, Th.; Six, H.-W.; Wood, D., On the correspondence between AVL trees and brother trees, Computing, 23, 43-54 (1979) · Zbl 0399.68069
[8] Van Leeuwen, J., The complexity of data organization, (Apt, K. R.; de Bakker, J. W., Foundations of Computer Science, 81 (1976), Mathematical Centre Tracts), 37-147, Part I · Zbl 0365.68047
[9] Wirth, N., Algorithms + Data Structures = Programs (1976), Prentice-Hall: Prentice-Hall Englewood Cliffs, N.J · Zbl 0375.68005
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.