1949 search results - page 58 / 390 » Random graphs on surfaces |
119
click to vote
RSA
2008
14 years 11 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 ...
102
click to vote
IJAMCIGI
2010
14 years 6 months 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 ...
128
click to vote
RECOMB
2004
Springer
16 years 5 days 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 ...
122
click to vote
CVPR
2009
IEEE
15 years 6 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...
RECOMB
2006
Springer
16 years 5 days ago
2006
Springer
