267 search results - page 7 / 54 » Anti-Ramsey properties of random graphs |
LICS
2002
IEEE
14 years 11 days ago
2002
IEEE
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
CAAN
2004
Springer
14 years 26 days ago
2004
Springer
We consider a generalized copy model of the web graph and related networks, and analyze its limiting behaviour. The model is motivated by previously proposed copying models of the ...
MICS
2010
13 years 5 months ago
2010
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...