36 search results - page 6 / 8 » Efficient influence maximization in social networks |
ISAAC
2010
Springer
13 years 3 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...
KDD
2007
ACM
14 years 6 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
GLOBECOM
2007
IEEE
14 years 2 days ago
2007
IEEE
—This paper focuses on routing tree construction problem and its influence on the performance of utilizing centralized scheduling in IEEE 802.16 mesh networks. We apply three rou...
MOBIHOC
2009
ACM
14 years 6 months ago
2009
ACM
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...
GPC
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient algorithm...