Selecting shortcuts for a smaller world

SIAM International Conference on Data Mining 2015, SDM 2015

Volumn , Issue , 2015, Pages 28-36

  Parotsidis, Nikos ^a   Pitoura, Evaggelia ^a   Tsaparas, Panayiotis ^a  

^a UNIVERSITY OF IOANNINA   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; HEURISTIC METHODS; SPACE DIVISION MULTIPLE ACCESS;

APPROXIMATION TECHNIQUES; COMBINATORIAL OPTIMIZATION PROBLEMS; NETWORK USERS; NP-HARD; SHORT-PATH; SHORTEST PATH; SMALL WORLD PHENOMENON; SOCIAL GRAPHS;

DATA MINING;

EID: 84961960485     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611974010.4     Document Type: Conference Paper

References (16)

1. Lada A. Adamic and Eytan Adar. Friends and neighbors on the web. Social Networks, 25(3):211-230, 2003.
2. Giorgio Ausiello, Giuseppe F Italiano, Alberto Marchetti Spaccamela, and Umberto Nanni. Incremental algorithms for minimal length paths. Journal of Algorithms, 12(4):615-638, 1991.
3. Vineet Chaoji, Sayan Ranu, Rajeev Rastogi, and Rushi Bhatt. Recommendations to boost content spread in social networks. In WWW, 2012.
4. Vatche Ishakian, Dora Erdös, Evimaria Terzi, and Azer Bestavros. A framework for the evaluation and management of network centrality. In SDM, 2012.
5. Konstantina Lazaridou, Konstantinos Semertzidis, Evaggelia Pitoura, and Panayiotis Tsaparas. Identifying converging pairs of nodes on a budget. In ED BT, 2015.
6. Michael Ley. The DBLP computer science bibliography: Evolution, research issues, perspectives. In SPIRE, 2002.
7. Dong Li, Zhiming Xu, Sheng Li, Xin Sun, Anika Gupta, and Katia Sycara. Link recommendation for promoting information diffusion in social networks. In WWW (Companion Volume), 2013.
8. David Liben-Nowell and Jon Kleinberg. The link-prediction problem for social networks. Journal of the American Society for Information Science and Technology, 58(7):1019-1031, 2007.
9. Adam Meyerson and Brian Tagiku. Minimizing average shortest path distances via shortcut edge addition. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 272-285. Springer, 2009.
10. Alan Mislove, Hema Swetha Koppula, Krishna P. Gummadi, Peter Druschel, and Bobby Bhattacharjee. Growth of the flickr social network. In ACM SIG-COMM Workshop on Social Networks (WOSN), 2008.
11. G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 1978.
12. Manos Papagelis, Francesco Bonchi, and Aristides Gionis. Suggesting ghost edges for a smaller world. In CIKM. ACM, 2011.
13. Ahmet Erdem Sariyüce, Kamer Kaya, Erik Saule, and Umit V. Çatalyurek. Incremental algorithms for network management and analysis based on closeness centrality. CoRR, abs/1303.0422, 2013.
14. Robert Tarjan. Finding dominators in directed graphs. SIAM Journal on Computing, 3(1):62-89, 1974.
15. Hanghang Tong, B. Aditya Prakash, Tina Eliassi-Rad, Michalis Faloutsos, and Christos Faloutsos. Gelling, and melting, large graphs by edge manipulation. In CIKM, 2012.
16. Bimal Viswanath, Alan Mislove, Meeyoung Cha, and Krishna P. Gummadi. On the evolution of user interaction in facebook. In ACM SIGCOMM Workshop on Social Networks (WOSN), 2009.