420 search results - page 5 / 84 » Search on High Degree Graphs |
SAC
2000
ACM
13 years 11 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
AVI
2006
13 years 8 months ago
2006
We present an experiment that compares how people perform search tasks in a degree-of-interest browser and in a Windows-Explorer-like browser. Our results show that, whereas users...
JGT
2010
13 years 5 months ago
2010
In 1996, Ota and Tokuda showed that a star-free graph with sufficiently high minimum degree admits a 2-factor. More recently it was shown that the minimum degree condition can be ...
STOC
1996
ACM
13 years 11 months ago
1996
ACM
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
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...