8 search results - page 2 / 2 » Deterministic random walks on regular trees |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...
CPC
2006
13 years 4 months ago
2006
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...