1067 search results - page 8 / 214 » Probabilistic regular graphs |
100
Voted
VLSM
2005
Springer
15 years 5 months ago
2005
Springer
Current state-of-the-art methods in variational image segmentation using level set methods are able to robustly segment complex textured images in an unsupervised manner. In recent...
STOC
2003
ACM
16 years 17 days ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
100
Voted
DM
2007
15 years 7 days ago
2007
The main aim of this short paper is to answer the following question. Given a fixed graph H, for which values of the degree d does a random d-regular graph on n vertices contain ...
117
Voted
JCT
2008
15 years 7 days ago
2008
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...
94
Voted
RSA
2006
15 years 5 days ago
2006
In this paper, we prove that there exists a function k = (4 + o(1))k such that G(n, /n) contains a k-regular graph with high probability whenever > k. In the case of k = 3, it...