Efficient sampling from random web graph and its application
This thesis presents space-efficient algorithms to sample from random web graphs generated by two important stochastic graph models based on concept of copying: the linear copy model and the hostgraph model. The goal is to avoid constructing the entire random graph, and instead use an amount of s...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | English en |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/1327 |