2310 search results - page 125 / 462 » Coloring Random Graphs |
125
click to vote
RSA
2008
15 years 1 months ago
2008
We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In ...
115
click to vote
SODA
1993
ACM
15 years 3 months ago
1993
ACM
We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched...
129
click to vote
COMBINATORICA
2008
15 years 2 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
150
click to vote
RECOMB
2004
Springer
16 years 2 months ago
2004
Springer
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
144
click to vote
CVPR
2009
IEEE
15 years 9 months ago
2009
IEEE
We formulate the problem of salient region detection in images as Markov random walks performed on images represented as graphs. While the global properties of the image are extra...