1591 search results - page 47 / 319 » Random lifts of graphs |
164
click to vote
COMBINATORICA
2008
15 years 5 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...
171
click to vote
RSA
2008
15 years 4 months ago
2008
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...
167
click to vote
IJAMCIGI
2010
15 years 7 days ago
2010
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
181
click to vote
RECOMB
2004
Springer
16 years 5 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 ...
182
click to vote
CVPR
2009
IEEE
16 years 7 days 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...