Biblio

Export 8 results:
Filters: Author is Zhiwei Zhang  [Clear All Filters]
Conference Paper
Zhang, Z., L. Qin, and J. Xu Yu, "Contract & Expand: I/O Efficient SCCs Computing", ICDE, pp. 208–219, 2014.
Zhang, Z., J. Xu Yu, L. Qin, and Z. Shang, "Divide & Conquer: I/O Efficient Depth-First Search", Proceedings of the 2015 {ACM} {SIGMOD} International Conference on Management of Data, Melbourne, Victoria, Australia, May 31 - June 4, 2015, pp. 445–458, 2015.
Shang, Z., F. Li, J. Xu Yu, Z. Zhang, and H. Cheng, "Graph Analytics Through Fine-Grained Parallelism", Proceedings of the 2016 International Conference on Management of Data, {SIGMOD} Conference 2016, San Francisco, CA, USA, June 26 - July 01, 2016, pp. 463–478, 2016.
Lu, C., J. Xu Yu, Z. Zhang, and H. Cheng, "Graph Iso/Auto-morphism: A Divide-&-Conquer Approach", SIGMOD, pp. 1195-1207, 2021.
Zhang, Z., J. Xu Yu, L. Qin, Q. Zhu, and X. Zhou, "I/O cost minimization: reachability queries processing over massive graphs", EDBT, pp. 468-479, 2012.
Zhang, Z., J. Xu Yu, L. Qin, L. Chang, and X. Lin, "I/O efficient: computing SCCs in massive graphs", SIGMOD Conference: ACM, pp. 181-192, 2013.
Journal Article
Zhao, K., Z. Zhang, Y. Rong, J. Xu Yu, and J. Huang, "Finding Critical Users in Social Communities via Graph Convolutions", IEEE Trans. Knowl. Data Eng., vol. 35, pp. 456–468, 2023.
Zhang, Z., J. Xu Yu, L. Qin, L. Chang, and X. Lin, "I/O efficient: computing SCCs in massive graphs", {VLDB} J., vol. 24, pp. 245–270, 2015.