Answering Min-Max Resource-Constrained Shortest Path Queries Over Large Graphs
IEEE Transactions on Knowledge and Data Engineering · 2025-01 · 37 (1) · 60-74
DOI: 10.1109/tkde.2024.3488095 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Knowledge and Data Engineering, 2025-01. Verfasst von Haoran Qian und 3 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 43 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Key Research and Development Project of the Ministry of Science and Technology of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
- Key Research and Development Project of the Ministry of Science and Technology of China
Zitieren
APA
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
Vancouver
Qian H, Zheng W, Zhang Z, Fu B. Answering Min-Max Resource-Constrained Shortest Path Queries Over Large Graphs. IEEE Transactions on Knowledge and Data Engineering. 2025;37(1):60-74. doi:10.1109/tkde.2024.3488095
BibTeX
@article{Qian2025,
author = {Qian, Haoran and Zheng, Weiguo and Zhang, Zhijie and Fu, Bo},
title = {Answering Min-Max Resource-Constrained Shortest Path Queries Over Large Graphs},
journal = {IEEE Transactions on Knowledge and Data Engineering},
year = {2025},
volume = {37},
number = {1},
pages = {60--74},
doi = {10.1109/tkde.2024.3488095}
}
EUVIMED