151 search results - page 11 / 31 » Edge Anonymity in Social Network Graphs |
ISAAC
2010
Springer
13 years 6 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
ISM
2006
IEEE
14 years 2 months ago
2006
IEEE
Given a large social or computer network, how can we visualize it, find patterns, outliers, communities? Although several graph visualization tools exist, they cannot handle larg...
CSE
2009
IEEE
14 years 3 months ago
2009
IEEE
— We examine the social behaviors of game experts in Everquest II, a popular massive multiplayer online role-playing game (MMO). We rely on Exponential Random Graph Models (ERGM)...
EPIA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...