Zhu, Q., Cheng, H., & Huang, X. (2017). I/O-efficient algorithms for top-k nearest keyword search in massive graphs. The VLDB journal, 26(4), 563-583. https://doi.org/10.1007/s00778-017-0464-7
Citace podle Chicago (17th ed.)Zhu, Qiankun, Hong Cheng, a Xin Huang. "I/O-efficient Algorithms for Top-k Nearest Keyword Search in Massive Graphs." The VLDB Journal 26, no. 4 (2017): 563-583. https://doi.org/10.1007/s00778-017-0464-7.
Citace podle MLA (9th ed.)Zhu, Qiankun, et al. "I/O-efficient Algorithms for Top-k Nearest Keyword Search in Massive Graphs." The VLDB Journal, vol. 26, no. 4, 2017, pp. 563-583, https://doi.org/10.1007/s00778-017-0464-7.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..