I/O-Efficient Multi-Criteria Shortest Paths Query Processing on Large Graphs
IEEE Transactions on Knowledge and Data Engineering · 2024-11 · 36 (11) · 6430-6446
DOI: 10.1109/tkde.2024.3386906 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Knowledge and Data Engineering, 2024-11. Verfasst von Xinjie Zhou und 4 weiteren Autor:innen. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 91 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: Hong Kong Research Grants Council, National Natural Science Foundation of China, Guangzhou–HKUST(GZ) Joint Funding Scheme.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Hong Kong Research Grants Council
- National Natural Science Foundation of China
- Guangzhou–HKUST(GZ) Joint Funding Scheme
- Jiangsu Big Data Intelligent Lab Project
- The Hong Kong Jockey Club Charities Trust
Zitieren
APA
Zhou, X., Huang, K., Li, L., Zhang, M., & Zhou, X. (2024). I/O-Efficient Multi-Criteria Shortest Paths Query Processing on Large Graphs. IEEE Transactions on Knowledge and Data Engineering, 36(11), 6430-6446. https://doi.org/10.1109/tkde.2024.3386906
Vancouver
Zhou X, Huang K, Li L, Zhang M, Zhou X. I/O-Efficient Multi-Criteria Shortest Paths Query Processing on Large Graphs. IEEE Transactions on Knowledge and Data Engineering. 2024;36(11):6430-6446. doi:10.1109/tkde.2024.3386906
BibTeX
@article{Zhou2024,
author = {Zhou, Xinjie and Huang, Kai and Li, Lei and Zhang, Mengxuan and Zhou, Xiaofang},
title = {I/O-Efficient Multi-Criteria Shortest Paths Query Processing on Large Graphs},
journal = {IEEE Transactions on Knowledge and Data Engineering},
year = {2024},
volume = {36},
number = {11},
pages = {6430--6446},
doi = {10.1109/tkde.2024.3386906}
}
EUVIMED