267 search results - page 44 / 54 » On the approximability of influence in social networks |
WWW
2010
ACM
15 years 4 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
CPAIOR
2007
Springer
15 years 3 months ago
2007
Springer
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
NETGAMES
2006
ACM
15 years 3 months ago
2006
ACM
— For better or worse, technological advancement has changed the world to the extent that at a professional level demands from the working executive required more hours either in...
104
click to vote
KAIS
2011
14 years 4 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
101
click to vote
SIGMOD
2011
ACM
14 years 13 days ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...