Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
On the impact of sense of direction on message complexity
Information Processing Letters
The degree sequence of a scale-free random graph process
Random Structures & Algorithms
Interval routing schemes allow broadcasting with linear message-complexity
Distributed Computing
Statistical mechanics of complex networks
Statistical mechanics of complex networks
The Diameter of a Scale-Free Random Graph
Combinatorica
A generic search strategy for large-scale real-world networks
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Maximum hitting time for random walks on graphs
Random Structures & Algorithms
A tight upper bound on the cover time for random walks on graphs
Random Structures & Algorithms
| Hi-index | 0.00 |
Scale-free networks naturally model wide area networks like the WWW. We consider the problem of fast exploration of huge scale-free networks using small memory space. Although there are many search algorithms for exploring an unknown graph, they require much space or time. For example, the depth first search requires some memory for all the nodes in the worst case, and the average number of steps in the random walk is O(n3), where n is the size of the graph. Under assumptions reflecting WWW applications, we propose a new exploration paradigm called forest search particularly designed for scale-free networks, and theoretically evaluate its space complexity. We also demonstrate its superiority over random walk based search algorithms by conducting simulations.