2079 search results - page 211 / 416 » Universality of random graphs |
160
click to vote
ICALP
1992
Springer
15 years 10 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
161
click to vote
DNA
2001
Springer
15 years 11 months ago
2001
Springer
In the universal DNA chip method, target RNAs are mapped onto a set of DNA tags. Parallel hybridization of these tags with an indexed, complementary antitag array then provides an ...
169
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in stati...
165
click to vote
AAAI
1996
15 years 8 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
154
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...