๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Efficient reconstruction of binary trees from their traversals

โœ Scribed by R.D. Cameron; B.K. Bhattacharya; E.A.T. Merks

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
334 KB
Volume
2
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient Reconstruction of Sequences fr
Efficient Reconstruction of Sequences from Their Subsequences or Supersequences
โœ Vladimir I. Levenshtein ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 176 KB

In the paper two combinatorial problems for the set F n q of sequences of length n over the alphabet F q =[0, 1, ..., q&1] are considered. The maximum size N & q (n, t) of the set of common subsequences of length n&t and the maximum size N + q (n, t) of the set of common supersequences of length n+t

Efficient Dynamic Embeddings of Binary T
Efficient Dynamic Embeddings of Binary Trees into Hypercubes
โœ Volker Heun; Ernst W. Mayr ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 255 KB

In this paper, a deterministic algorithm for dynamically embedding binary trees into hypercubes is presented. Because of a known lower bound, any such algorithm must use either randomization or migration, i.e., remapping of tree vertices, to obtain an embedding of trees into hypercubes with small di