Cite
Finding Top-k Shortest Paths with Diversity.
MLA
Liu, Huiping, et al. “Finding Top-k Shortest Paths with Diversity.” IEEE Transactions on Knowledge & Data Engineering, vol. 30, no. 3, Mar. 2018, pp. 488–502. EBSCOhost, https://doi.org/10.1109/TKDE.2017.2773492.
APA
Liu, H., Jin, C., Yang, B., & Zhou, A. (2018). Finding Top-k Shortest Paths with Diversity. IEEE Transactions on Knowledge & Data Engineering, 30(3), 488–502. https://doi.org/10.1109/TKDE.2017.2773492
Chicago
Liu, Huiping, Cheqing Jin, Bin Yang, and Aoying Zhou. 2018. “Finding Top-k Shortest Paths with Diversity.” IEEE Transactions on Knowledge & Data Engineering 30 (3): 488–502. doi:10.1109/TKDE.2017.2773492.