Starting with a monodisperse configuration with n size–1 particles , an additive Marcus–Lushnikov process evolves until it reaches its final state (a unique particle with mass n). At each of the n − 1 steps of its evolution , a merging cost is incurred, that depends on the sizes of the two particles involved, and on an independent random factor. This paper studies the asymp-totic behaviour of t...

We present an efficient method to segment large 3d images that takes the whole 3-dimensional structure into account. We use a Union-Find data structure to record and maintain the necessary informations during the segmentation process. This structure leads to a volume labelling and facilitates interactive process by linking directly voxels to the volume they belong to. Moreover the global integr...

Overlapping community detection has become an important challenge in networks analysis that motivates researchers to propose methods best fit existing complex and non-disjoint structures real-world such as social, scientific collaborative networks. Existing overlapping usually build large overlaps between communities, larger than expected, do not allow users interact with the system regulate th...

We consider the problem of finding a maximum disjoint set of boundary rectangles, where all rectangles are attached to the boundary of a bounding box. We present an algorithm for solving the problem in O(n) time, improving upon the best previous O(n)-time solution available for the problem.

Chen et al. [Partitioning vertices of a tournament into independent cycles, J. Combin. Theory Ser. B 83 (2001) 213–220] proved that every k-connected tournament with at least 8k vertices admits k vertex-disjoint cycles spanning the vertex set, which answered a question posed by Bollobas. In this paper, we prove, as a consequence of a more general result, that every k-connected tournament of dia...

Let D j, j = 1 , . . . , 5, be simply-connected domains on the Riemann sphere with piecewise analytic boundary and pairwise disjoint closures. Let D C C be a domain and denote by 3rA(D) = f a (D, {Dj}~=I) the family of all meromorphic functions f : D ~ C with the property that no subdomain of D is mapped conformally onto one of the domains Dj by f . (If there is such a subdomain, then it is cal...