Biblio

Export 9 results:
Filters: Author is Yikai Zhang  [Clear All Filters]
Conference Paper
Zhang, H., J. Xu Yu, Y. Zhang, K. Zhao, and H. Cheng, "Distributed Subgraph Counting: A General Approach", PVLDB, pp. 2493-2507, 2020.
Zhang, Y., J. Xu Yu, Y. Zhang, and L. Qin, "A Fast Order-Based Approach for Core Maintenance", 33rd {IEEE} International Conference on Data Engineering, {ICDE} 2017, San Diego, CA, USA, April 19-22, 2017, pp. 337–348, 2017.
Zhang, Y., and J. Xu Yu, "Hub Labeling for Shortest Path Counting", SIGMOD, pp. 1813-1828, 2020.
Zhang, H., J. Xu Yu, Y. Zhang, and K. Zhao, "Parallel Query Processing: To Separate Communication from Computation", SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12 - 17, 2022: ACM, pp. 1447–1461, 2022.
Zhang, Y., and J. Xu Yu, "Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs", SIGMOD, pp. 1024-1041, 2019.
Journal Article
Lu, C., J. Xu Yu, H. Wei, and Y. Zhang, "Enumerating Maximum Cliques in Massive Graphs", IEEE Trans. Knowl. Data Eng., vol. 34, pp. 4215–4230, 2022.
Zhang, Y., J. Xu Yu, Y. Zhang, and L. Qin, "A Fast Order-Based Approach for Core Maintenance", CoRR, vol. abs/1606.00200, 2016.
Lu, C., J. Xu Yu, H. Wei, and Y. Zhang, "Finding the maximum clique in massive graphs", {PVLDB}, vol. 10, pp. 1538–1549, 2017.
Huang, W., Y. Zhang, Z. Shang, and J. Xu Yu, "To Meet or Not to Meet: Finding the Shortest Paths in Road Networks", {IEEE} Trans. Knowl. Data Eng., vol. 30, pp. 772–785, 2018.