Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...
— In this paper, we study the dynamics of a viral spreading process in random geometric graphs (RGG). The spreading of the viral process we consider in this paper is closely rela...
In this paper we propose an image segmentation algorithm that combines region merging with spectral-based techniques. An initial partitioning of the image into primitive regions i...
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...