Sciweavers

2310 search results - page 64 / 462
» Coloring Random Graphs
Sort
View
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
14 years 6 months ago
Randomization Techniques for Graphs.
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
IDA
2009
Springer
14 years 1 months ago
Image Source Separation Using Color Channel Dependencies
We investigate the problem of source separation in images in the Bayesian framework using the color channel dependencies. As a case in point we consider the source separation of co...
Koray Kayabol, Ercan E. Kuruoglu, Bülent Sank...
CORR
2010
Springer
60views Education» more  CORR 2010»
13 years 9 months ago
Hitting time results for Maker-Breaker games
We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph proc...
Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael...
COMBINATORICA
2008
87views more  COMBINATORICA 2008»
13 years 9 months ago
Quasi-randomness and the distribution of copies of a fixed graph
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...
Asaf Shapira
EJC
2006
13 years 9 months ago
3-star factors in random d-regular graphs
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been u...
Hilda Assiyatun, Nicholas C. Wormald