420 search results - page 23 / 84 » Generating random regular graphs |
CSL
2006
Springer
13 years 11 months ago
2006
Springer
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...
LATIN
1998
Springer
13 years 12 months ago
1998
Springer
The existence of efficient algorithms to compute the eigenvectors and eigenvalues of graphs supplies a useful tool for the design of various graph algorithms. In this survey we de...
IJCAI
2001
13 years 9 months ago
2001
We show that nodes of high degree tend to occur infrequently in random graphs but frequently in a wide variety of graphs associated with real world search problems. We then study ...
STOC
1998
ACM
13 years 12 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
ICALP
2009
Springer
14 years 2 months ago
2009
Springer
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...