𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient Exploration of Faulty Trees

✍ Scribed by Euripides Markou; Andrzej Pelc

Publisher
Springer
Year
2006
Tongue
English
Weight
286 KB
Volume
40
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient generation of plane trees
Efficient generation of plane trees
✍ Shin-ichi Nakano πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 96 KB

A rooted plane tree is a rooted tree with a left-to-right ordering specified for the children of each vertex. In this paper we give a simple algorithm to generate all rooted plane trees with at most n vertices. The algorithm uses O(n) space and generates such trees in O(1) time per tree without dupl

Efficient rebalancing of chromatic searc
Efficient rebalancing of chromatic search trees
✍ Joan Boyar; Kim S. Larsen πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 827 KB

Chromatic trees were defined by Nurmi and Soisalon-Soininen, as a new type of binary search tree for databases. The aim is to improve runtime performance by allowing a greater degree of concurrency, which, in turn, is obtained by uncoupling updating from rebalancing. This also allows rebalancing to

Efficient Merging and Construction of Ev
Efficient Merging and Construction of Evolutionary Trees
✍ Andrzej Lingas; Hans Olsson; Anna Γ–stlin πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 99 KB

In this paper we study the algorithmic problem of constructing rooted evolutionary trees in the so-called experiment model. This model was first presented by Ε½ Ε½ . .