Citace podle APA (7th ed.)

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

Citace podle Chicago (17th ed.)

Qian, Haoran, Weiguo Zheng, Zhijie Zhang, a 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.

Citace podle MLA (9th ed.)

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.

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..