Identifying converging pairs of Nodes on a Budget

EDBT 2015 - 18th International Conference on Extending Database Technology, Proceedings

Volumn , Issue , 2015, Pages 313-324

  Lazaridou, Konstantina ^a   Semertzidis, Konstantinos ^b   Pitoura, Evaggelia ^b   Tsaparas, Panayiotis ^b  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

^b UNIVERSITY OF IOANNINA   (Greece)

Author keywords

Graphs; Shortest paths; Top k

Indexed keywords

BUDGET CONTROL;

DISTANCE ESTIMATION; FIXED BUDGET; GRAPHS; LARGE GRAPHS; LARGE NETWORKS; REAL-WORLD DATASETS; SHORTEST PATH; SINGLE SOURCE SHORTEST PATHS;

GRAPH THEORY;

EID: 84945224870     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5441/002/edbt.2015.28     Document Type: Conference Paper

References (25)

1. Réka Albert and Albert-László Barabási. Emergence of scale in random networks. Science, 286: 509-512, 1999.
2. Lars Backstrom, Daniel P. Huttenlocher, Jon M. Kleinberg, and Xiangyang Lan. Group formation in large social networks: membership, growth, and evolution. In KDD, pages 44-54, 2006.
3. Mario Cannataro, Pietro H. Guzzi, and Pierangelo Veltri. Protein-to-protein interactions: Technologies, databases, and algorithms. ACM Comput. Surv., 43(1): 1:1-1:36, December 2010.
4. Vineet Chaoji, Sayan Ranu, Rajeev Rastogi, and Rushi Bhatt. Recommendations to boost content spread in social networks. In WWW, pages 529-538, 2012.
5. M. Christoforaki and T. Suel. Estimating pairwise distances in large graphs. In BigData, 2014.
6. Sara Cohen, Benny Kimelfeld, and Georgia Koutrika. A survey on proximity measures for social networks. In SeCO Book, pages 191-206. ACM, 2012.
7. Camil Demetrescu and Giuseppe F. Italiano. A new approach to dynamic all pairs shortest paths. In STOC, pages 159-166, 2003.
8. Marina Drosou and Evaggelia Pitoura. Disc diversity: result diversification based on dissimilarity and coverage. PVLDB, 6(1): 13-24, 2012.
9. David A. Easley and Jon M. Kleinberg. Networks, Crowds, and Markets - Reasoning About a Highly Connected World. Cambridge University Press, 2010.
10. Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. On power-law relationships of the internet topology. In SIGCOMM, pages 251-262, 1999.
11. Rong-En Fan, Kai-Wei Chang, Cho-Jui Hsieh, Xiang-Rui Wang, and Chih-Jen Lin. LIBLINEAR: A library for large linear classification. Journal of Machine Learning Research, 9: 1871-1874, 2008.
12. M. Girvan and M. E. J. Newman. Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99(12): 7821-7826, 2002.
13. Sreenivas Gollapudi and Aneesh Sharma. An axiomatic approach for result diversification. In WWW, pages 381-390, 2009.
14. Manish Gupta, Charu C. Aggarwal, and Jiawei Han. Finding top-k shortest path distance changes in an evolutionary network. In SSTD, pages 130-148, 2011.
15. Jure Leskovec, Jon M. Kleinberg, and Christos Faloutsos. Graph evolution: Densification and shrinking diameters. TKDD, 1(1), 2007.
16. David Liben-Nowell and Jon M. Kleinberg. The link-prediction problem for social networks. JASIST, 58(7): 1019-1031, 2007.
17. Alan Mislove. Online Social Networks: Measurement, Analysis, and Applications to Distributed Information Systems. PhD thesis, Rice University, Department of Computer Science, May 2009.
18. Manos Papagelis, Francesco Bonchi, and Aristides Gionis. Suggesting ghost edges for a smaller world. In CIKM, pages 2305-2308, 2011.
19. N. Parotisidis, E. Pitoura, and P. Tsaparas. Selecting shortcuts for a smaller world. In SIAM International Conference on Data Mining (SDM), 2015.
20. Michalis Potamias, Francesco Bonchi, Carlos Castillo, and Aristides Gionis. Fast shortest path distance estimation in large networks. In CIKM, pages 867-876, 2009.
21. Hanghang Tong, Spiros Papadimitriou, Philip S. Yu, and Christos Faloutsos. Proximity tracking on time-evolving bipartite graphs. In SDM, pages 704-715, 2008.
22. Hanghang Tong, B. Aditya Prakash, Tina Eliassi-Rad, Michalis Faloutsos, and Christos Faloutsos. Gelling, and melting, large graphs by edge manipulation. In CIKM, pages 245-254, 2012.
23. Konstantin Tretyakov, Abel Armas-Cervantes, Luciano García-Bañuelos, Jaak Vilo, and Marlon Dumas. Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs. In CIKM, pages 1785-1794, 2011.
24. Vijay V. Vazirani. Approximation algorithms. Springer-Verlag New York, Inc., New York, NY, USA, 2001.
25. Xiaohan Zhao, Alessandra Sala, Christo Wilson, Haitao Zheng, and Ben Y. Zhao. Orion: Shortest path estimation for large social graphs. In WOSN, 2010.