Finding top-k shortest path distance changes in an evolutionary network

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6849 LNCS, Issue , 2011, Pages 130-148

  Gupta, Manish ^a   Aggarwal, Charu C ^b   Han, Jiawei ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY NETWORK; EVOLVING GRAPHS; LARGE GRAPHS; NODE PAIRS; ORDERS OF MAGNITUDE; SHORTEST PATH; SHORTEST PATH ALGORITHMS; SPATIO-TEMPORAL APPLICATIONS;

EVOLUTIONARY ALGORITHMS;

GRAPH THEORY;

EID: 80052707774     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22922-0_9     Document Type: Conference Paper

References (26)

1. Aggarwal, C.C. (ed.): Social Network Data Analytics. Springer, Heidelberg (2011)
2. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)
3. Ahuja, R.K., Orlin, J.B., Pallottino, S., Scutella, M.G.: Dynamic shortest paths minimizing travel times and costs. Networks 41, 205 (2003)
4. Henzinger, M., King, V.: Maintaining minimum spanning forests in dynamic graphs. SIAM Journal on Computing 31(2), 364-374 (2001)
5. Akoglu, L., McGlohon, M., Faloutsos, C.: oddball: Spotting Anomalies in Weighted Graphs. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010. LNCS, vol. 6119, pp. 410-421. Springer, Heidelberg (2010)
6. Chabini, I., Ganugapati, S.: Parallel algorithms for dynamic shortest path problems. International Transactions in Operational Research 9(3), 279-302 (2002)
7. Chakrabarti, D., Kumar, R., Tomkins, A.: Evolutionary clustering. In: KDD, pp. 554-560 (2006)
8. Chakraborty, D., Chakraborty, G., Shiratori, N.: A dynamic multicast routing satisfying multiple qos constraints. Int. J. Network Management 13(5), 321-335 (2003)
9. Cherkassky, B.V., Goldberg, A.V., Silverstein, C.: Buckets, heaps, lists, and monotone priority queues. In: SODA (1997)
10. Cohen, E.: Estimating the size of the transitive closure in linear time. In: FOCS (1994)
11. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269-271 (1959)
12. Doreian, P., Stokman, F.: Evolution of social networks. Gordon and Breach Publishers, New York (1997)
13. Eberle, W., Holder, L.: Discovering structural anomalies in graph-based data. In: ICDMW, pp. 393-398 (2007)
14. Floyd, R.W.: Algorithm 97: Shortest path. Commun. ACM 5(6), 345 (1962)
15. Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks. J. ACM 24(1), 1-13 (1977)
16. Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359-392 (1998)
17. Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: Densification and shrinking diameters. ACM TKDD 1(1), 2 (2007)
18. Papadimitriou, P., Dasdan, A., Garcia-Molina, H.: Web graph similarity for anomaly detection (poster). In: WWW, pp. 1167-1168 (2008)
19. Roditty, L., Zwick, U.: On dynamic shortest paths problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 580-591. Springer, Heidelberg (2004)
20. Shimbel, A.: Structural parameters of communication networks. Bulletin of Mathematical Biology 15, 501-507 (1953)
21. Warshall, S.: A theorem on boolean matrices. J. ACM 9(1), 11-12 (1962)
22. Zhu, S., Huang, G.M.: A new parallel and distributed shortest path algorithm for hierarchically clustered data networks. IEEE Trans. Parallel Dist. Syst. 9(9), 841-855 (1998)
23. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E 69 (2004)
24. Brandes, U.: A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 25(2), 163-177 (2001)
25. Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT, pp. 205-216 (2008)
26. Chon, H.D., Agrawal, D., Abbadi, A.E.: FATES: Finding A Time Dependent Shortest path. Mobile Data Management, 165-180 (2003)