147 search results - page 30 / 30 » Discovering Spammers in Social Networks |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
WWW
2009
ACM
14 years 6 months ago
2009
ACM
Users of social networking services can connect with each other by forming communities for online interaction. Yet as the number of communities hosted by such websites grows over ...