14 search results - page 3 / 3 » Quasirandomness in Graphs |
CPC
2002
13 years 5 months ago
2002
SODA
2010
ACM
14 years 2 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 ...
SIGAL
1990
13 years 9 months ago
1990
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...
SIAMDM
2008
13 years 5 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...