• Aucun résultat trouvé

Computing and updating the process number in trees

N/A
N/A
Protected

Academic year: 2021

Partager "Computing and updating the process number in trees"

Copied!
5
0
0

Texte intégral

Figure

Figure 1: Starting from the routing of Fig. 1(a), the removal of request (1,6) and addition of request (1,4) gives the routing of Fig

Références

Documents relatifs

We propose that in the course of evolution these unicellular photoreceptors has duplicated and differ- entiated into at least two different cell types, photoreceptor cells and

Our investigation treats the average number of transversals of fixed size, the size of a random transversal as well as the probability that a random subset of the vertex set of a

Throughout this paper, we shall use the following notations: N denotes the set of the positive integers, π( x ) denotes the number of the prime numbers not exceeding x, and p i

Our interest in such a model arises from the following fact: There is a classical evolution process, presented for example in [5], to grow a binary increasing tree by replacing at

Since there are no binary trees with an even number of vertices, it would perhaps be useful to consider inead binary trees with k leaves (a leaf being a vertex without a

works of Seleznjev (1996) (linear interpolation) , Seleznjev (2000) (Hermite interpolation splines, optimal designs), Seleznjev and Buslaev (1998) (best approximation order).. For

The goal of this article is to give another generalization of Stanley’s conjecture to colored permutations. Our result is stated in terms of the flag descents and flag excedences

The McGill Journal of Education promotes an international, multidisciplinary discussion of issues  in  the  field  of  educational  research,  theory,  and