The diameter of a cycle plus a random matching
SIAM Journal on Discrete Mathematics
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Distance estimation and object location via rings of neighbors
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Could any graph be turned into a small-world?
Theoretical Computer Science - Complex networks
Navigating low-dimensional and hierarchical population networks
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Greedy routing in tree-decomposed graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Indexing Network Structure with Shortest-Path Trees
ACM Transactions on Knowledge Discovery from Data (TKDD)
| Hi-index | 0.00 |
We study a general framework for decentralized search in random graphs. Our main focus is on deterministic memoryless search algorithms that use only local information to reach their destination in a bounded number of steps in expectation. This class includes (with small modifications) the search algorithms used in Kleinberg's pioneering work on long-range percolation graphs and hierarchical network models. We give a characterization of searchable graphs in this model, and use this characterization to prove a monotonicity property for searchability.