wsgan001 / graph-processing-bibliography Goto Github PK

Graph-Processing-Bibliography

Armenatzoglou N, Pham H, Ntranos V, et al. Real-time multi-criteria social graph partitioning: A game theoretic approach[C]//Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. ACM, 2015: 1617-1628. pdf

Li R H, Yu J X, Huang X, et al. Random-walk domination in large graphs[C]//Data Engineering (ICDE), 2014 IEEE 30th International Conference on. IEEE, 2014: 736-747. pdf

Fan W, Wang X, Wu Y. Querying big graphs within bounded resources[C]//Proceedings of the 2014 ACM SIGMOD international conference on Management of data. ACM, 2014: 301-312. pdf

Wu Y, Jin R, Zhu X, et al. Finding dense and connected subgraphs in dual networks[C]//Data Engineering (ICDE), 2015 IEEE 31st International Conference on. IEEE, 2015: 915-926. pdf

Epasto A, Lattanzi S, Mirrokni V, et al. Ego-net community mining applied to friend suggestion[J]. Proceedings of the VLDB Endowment, 2015, 9(4): 324-335. pdf

Zhu A D, Lin W, Wang S, et al. Reachability queries on large dynamic graphs: a total order approach[C]//Proceedings of the 2014 ACM SIGMOD international conference on Management of data. ACM, 2014: 1323-1334. pdf

Shao Y, Cui B, Chen L, et al. Parallel subgraph listing in a large-scale graph[C]//Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. ACM, 2014: 625-636. pdf

Then M, Kaufmann M, Chirigati F, et al. The more the merrier: Efficient multi-source graph traversal[J]. Proceedings of the VLDB Endowment, 2014, 8(4): 449-460. pdf

Funke S, Nusser A, Storandt S. On k-path covers and their applications[J]. Proceedings of the VLDB Endowment, 2014, 7(10): 893-902. pdf

Zhou Y, Liu L, Lee K, et al. GraphTwist: fast iterative graph computation with two-tier optimizations[J]. Proceedings of the VLDB Endowment, 2015, 8(11): 1262-1273. pdf

Yuan D, Mitra P, Yu H, et al. Updating graph indices with a one-pass algorithm[C]//Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. ACM, 2015: 1903-1916. pdf

Wu Y, Jin R, Li J, et al. Robust local community detection: on free rider effect and its elimination[J]. Proceedings of the VLDB Endowment, 2015, 8(7): 798-809. pdf

Hassan M S, Aref W G, Aly A M. Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs[C]//Proceedings of the 2016 International Conference on Management of Data. ACM, 2016: 1183-1197. pdf

Zhu A D, Ma H, Xiao X, et al. Shortest path and distance queries on road networks: towards bridging theory and practice[C]//Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. ACM, 2013: 857-868. pdf

Fu Z Y A W C, Liu R. Diversified Top-k Subgraph Querying in a Large Graph[J]. pdf

Chi Y, Dai G, Wang Y, et al. NXgraph: an efficient graph processing system on a single machine[C]//Data Engineering (ICDE), 2016 IEEE 32nd International Conference on. IEEE, 2016: 409-420. pdf

Kalavri V, Simas T, Logothetis D. The shortest path is not always a straight line: Leveraging semi-metricity in graph analysis[C]// VLDB. 2016:672-683. pdf

Shi L, Sun S, Xuan Y, et al. TOPIC: TOward Perfect InfluenCe Graph Summarization[C]//Data Engineering (ICDE), 2016 IEEE 32nd International Conference on. IEEE, 2016: 1074-1085. pdf

Sarıyüce A E, Gedik B, Jacques-Silva G, et al. Incremental k-core decomposition: algorithms and evaluation[J]. The VLDB Journal, 2016, 25(3): 425-447. pdf

Hayashi T, Akiba T, Yoshida Y. Fully dynamic betweenness centrality maintenance on massive networks[J]. Proceedings of the VLDB Endowment, 2015, 9(2): 48-59. pdf

Julian Shun, Farbod Roosta-Khorasani, Kimon Fountoulakis, Michael W. Mahoney: Parallel Local Graph Clustering. PVLDB 9(12): 1041-1052 (2016) pdf

Fan W, Wang X, Wu Y, et al. Association rules with graph patterns[J]. Proceedings of the VLDB Endowment, 2015, 8(12): 1502-1513. pdf

Elseidy M, Abdelhamid E, Skiadopoulos S, et al. Grami: Frequent subgraph and pattern mining in a single large graph[J]. Proceedings of the VLDB Endowment, 2014, 7(7): 517-528. pdf

Fan W, Hu C. Big Graph Analyses: From Queries to Dependencies and Association Rules[J]. Data Science and Engineering, 1-20. pdf

Liu Y, Lu J, Yang H, et al. Towards maximum independent sets on massive graphs[J]. Proceedings of the VLDB Endowment, 2015, 8(13): 2122-2133. pdf

Henzinger, Monika Rauch, Thomas A. Henzinger, and Peter W. Kopke. "Computing simulations on finite and infinite graphs." Foundations of Computer Science, 1995. Proceedings., 36th Annual Symposium on. IEEE, 1995. pdf

Fan, Wenfei, et al. "Distributed graph simulation: Impossibility and possibility." Proceedings of the VLDB Endowment 7.12 (2014): 1083-1094. pdf

Liu, Yang, et al. "Mapreduce-based pattern finding algorithm applied in motif detection for prescription compatibility network." International Workshop on Advanced Parallel Processing Technologies. Springer Berlin Heidelberg, 2009. pdf

Wu, Bin, and YunLong Bai. "An efficient distributed subgraph mining algorithm in extreme large graphs." Artificial Intelligence and Computational Intelligence (2010): 107-115. [pdf]N/A

Meng J, Tu Y. Flexible and feasible support measures for mining frequent patterns in large labeled graphs[C]//Proceedings of the 2017 ACM International Conference on Management of Data. ACM, 2017: 391-402. pdf

Fan W, Hu C, Tian C. Incremental graph computations: Doable and undoable[C]//Proceedings of the 2017 ACM International Conference on Management of Data. ACM, 2017: 155-169. pdf

Wenfei Fan, Jingbo Xu, Yinghui Wu, Wenyuan Yu, Jiaxin Jiang, Zeyu Zheng, Bohan Zhang, Yang Cao, Chao Tian: Parallelizing Sequential Graph Computations. SIGMOD Conference 2017: 495-510 pdf