A Universal Scheme for Dynamic Partitioned Shortest Path Index
IEEE Transactions on Knowledge and Data Engineering · 2026-12 · 38 (12) · 7909-7928
DOI: 10.1109/tkde.2026.3734956 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Knowledge and Data Engineering, 2026-12. Verfasst von Mengxuan Zhang und 6 weiteren Autor:innen. Die Arbeit nennt 109 Literaturangaben. Gefördert von: National Key R&D Program of China, National Natural Science Foundation of China, Hong Kong RGC.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Key R&D Program of China
- National Natural Science Foundation of China
- Hong Kong RGC
- HKUST-HKUST(GZ) Cross-campus Research Collaboration “1+1+1” Joint Funding Program
- JC STEM DSF Lab
- Hong Kong Jockey Club Charities Trust
Zitieren
APA
Zhang, M., Zhou, X., Wu, R., Li, L., Liu, Z., Trajcevski, G., & Zhou, X. (2026). A Universal Scheme for Dynamic Partitioned Shortest Path Index. IEEE Transactions on Knowledge and Data Engineering, 38(12), 7909-7928. https://doi.org/10.1109/tkde.2026.3734956
Vancouver
Zhang M, Zhou X, Wu R, Li L, Liu Z, Trajcevski G, et al. A Universal Scheme for Dynamic Partitioned Shortest Path Index. IEEE Transactions on Knowledge and Data Engineering. 2026;38(12):7909-7928. doi:10.1109/tkde.2026.3734956
BibTeX
@article{Zhang2026,
author = {Zhang, Mengxuan and Zhou, Xinjie and Wu, Ruizhong and Li, Lei and Liu, Ziyi and Trajcevski, Goce and Zhou, Xiaofang},
title = {A Universal Scheme for Dynamic Partitioned Shortest Path Index},
journal = {IEEE Transactions on Knowledge and Data Engineering},
year = {2026},
volume = {38},
number = {12},
pages = {7909--7928},
doi = {10.1109/tkde.2026.3734956}
}
EUVIMED