Network algorithm exploits ‘six degrees of separation’
A method of discerning the shortest path between two points in a network may reduce bandwidth for peer-to-peer file-sharing communities
An algorithm that finds the shortest path between two points in a computer network is shedding light on the puzzling “six degrees of separation” social phenomenon.
According to this social theory, a person can be connected to any other person through just six acquaintances. By harnessing this concept, say scientists, a computer algorithm could reduce bandwidth in peer-to-peer (P2P) file-sharing communities and pave the way for ad hoc emergency cellphone communications.
