On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
| Hi-index | 0.00 |
This article considers computational aspects of web-of-trust-like approaches in distributed, peer-to-peer environments. The key algorithmic issue here is finding the shortest trusted path between two participants. This is a kind of all-pairs-shortest-path problem and it is found to be resolvable assuming scale-free social graph topology and sublinear per-node resource constraints.