Cite
Holistic Top-k Simple Shortest Path Join in Graphs.
MLA
Gao, Jun, et al. “Holistic Top-k Simple Shortest Path Join in Graphs.” IEEE Transactions on Knowledge & Data Engineering, vol. 24, no. 4, Apr. 2012, pp. 665–77. EBSCOhost, https://doi.org/10.1109/TKDE.2011.117.
APA
Gao, J., Yu, J., Qiu, H., Jiang, X., Wang, T., & Yang, D. (2012). Holistic Top-k Simple Shortest Path Join in Graphs. IEEE Transactions on Knowledge & Data Engineering, 24(4), 665–677. https://doi.org/10.1109/TKDE.2011.117
Chicago
Gao, Jun, Jeffrey Yu, Huida Qiu, Xiao Jiang, Tengjiao Wang, and Dongqing Yang. 2012. “Holistic Top-k Simple Shortest Path Join in Graphs.” IEEE Transactions on Knowledge & Data Engineering 24 (4): 665–77. doi:10.1109/TKDE.2011.117.