721 search results - page 36 / 145 » Almost universal graphs |
109
click to vote
WAW
2009
Springer
15 years 7 months ago
2009
Springer
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
ENTCS
2008
15 years 26 days ago
2008
Abstract Machine Greg Manning1 Detlef Plump2 Department of Computer Science The University of York, UK duce the York Abstract Machine (YAM) for implementing the graph programming ...
114
Voted
ESA
2001
Springer
15 years 5 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
113
click to vote
CORIA
2006
15 years 2 months ago
2006
The annotation of images data is the main tool for associating semantics to an image. In this article we are interested in the semi-automatic annotation of images data. Indeed, wit...
108
click to vote
CPC
2007
15 years 23 days ago
2007
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n−1 + λn−4/...