Approximating Shortest Paths in Spatial Social Networks
We evaluate an algorithm that efficiently computes short paths in social networks by exploiting their spatial component. The main idea is very simple and builds upon Milgram's seminal social experiment, where target individuals were found by having participants forward, or route, messages towar...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2016
|
Online Access: | http://hdl.handle.net/1721.1/101694 https://orcid.org/0000-0003-2026-5631 |