Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleMarch 2023
Depth of Field and Cautious-Greedy Routing in Social Networks
AbstractSocial networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the probability that person u befriends person v is inversely proportional to ...
- ArticleDecember 2007
Depth of field and cautious-greedy routing in social networks
ISAAC'07: Proceedings of the 18th international conference on Algorithms and computationPages 574–586Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship--where the probability that person u befriends person v is inversely proportional to the ...