APA (7th ed.) Citation

Qian, H., Zheng, W., Zhang, Z., & Fu, B. (2025). Answering Min-Max Resource-Constrained Shortest Path Queries Over Large Graphs. IEEE transactions on knowledge and data engineering, 37(1), 60-74. https://doi.org/10.1109/TKDE.2024.3488095

Chicago Style (17th ed.) Citation

Qian, Haoran, Weiguo Zheng, Zhijie Zhang, and Bo Fu. "Answering Min-Max Resource-Constrained Shortest Path Queries Over Large Graphs." IEEE Transactions on Knowledge and Data Engineering 37, no. 1 (2025): 60-74. https://doi.org/10.1109/TKDE.2024.3488095.

MLA (9th ed.) Citation

Qian, Haoran, et al. "Answering Min-Max Resource-Constrained Shortest Path Queries Over Large Graphs." IEEE Transactions on Knowledge and Data Engineering, vol. 37, no. 1, 2025, pp. 60-74, https://doi.org/10.1109/TKDE.2024.3488095.