Graph analysis: do we have to reinvent the wheel?
暂无分享,去创建一个
Zhe Wu | Jay Banerjee | Adam Welc | Sungpack Hong | Hassan Chafi | Raghavan Raman | Adam Welc | Sungpack Hong | Zhe Wu | Raghavan Raman | J. Banerjee | Hassan Chafi
[1] Kunle Olukotun,et al. Green-Marl: a DSL for easy and efficient graph analysis , 2012, ASPLOS XVII.
[2] Kamesh Madduri,et al. SNAP (Small-World Network Analysis and Partitioning) Framework , 2011, Encyclopedia of Parallel Computing.
[3] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[4] Dorothea Wagner,et al. Speed-Up Techniques for Shortest-Path Computations , 2007, STACS.
[5] Rizal Setya Perdana. What is Twitter , 2013 .
[6] Hosung Park,et al. What is Twitter, a social network or a news media? , 2010, WWW '10.
[7] Prabhakar Ragde,et al. A bidirectional shortest-path algorithm with good average-case behavior , 1989, Algorithmica.
[8] Jim Webber,et al. Graph Databases: New Opportunities for Connected Data , 2013 .
[9] Sherif Sakr,et al. G-SPARQL: a hybrid engine for querying large attributed graphs , 2012, CIKM.
[10] Jeffrey Xu Yu,et al. Relational Approach for Shortest Path Discovery over Large Graphs , 2011, Proc. VLDB Endow..
[11] Andreas Reuter,et al. Transaction Processing: Concepts and Techniques , 1992 .