—Identifying unusual or unique characteristics of an observed sample in useful in forensics in general and handwriting analysis in particular. Rarity is formulated as the probabi...
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
In the last few years there has been a great amount of interest in Random Constraint Satisfaction Problems, both from an experimental and a theoretical point of view. Quite intrigu...
Dimitris Achlioptas, Lefteris M. Kirousis, Evangel...
Chang and Lyuu [Chang and Lyuu, 2008] study the spreading of a message in an Erd˝os-R´enyi random graph G(n, p) starting from a set of vertices that are convinced of the message...