Crossref
Efficient algorithms for reachability and path queries on temporal bipartite graphs
The VLDB Journal · 2024-09 · 33 (5) · 1399-1426
DOI: 10.1007/s00778-024-00854-z ↗Kurz gefasst
Fachartikel in der Zeitschrift The VLDB Journal, online erschienen am 23.05.2024. Verfasst von Kai Wang und 6 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 64 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Wang, K., Cai, M., Chen, X., Lin, X., Zhang, W., Qin, L., & Zhang, Y. (2024). Efficient algorithms for reachability and path queries on temporal bipartite graphs. The VLDB Journal, 33(5), 1399-1426. https://doi.org/10.1007/s00778-024-00854-z
Vancouver
Wang K, Cai M, Chen X, Lin X, Zhang W, Qin L, et al. Efficient algorithms for reachability and path queries on temporal bipartite graphs. The VLDB Journal. 2024;33(5):1399-1426. doi:10.1007/s00778-024-00854-z
BibTeX
@article{Wang2024,
author = {Wang, Kai and Cai, Minghao and Chen, Xiaoshuang and Lin, Xuemin and Zhang, Wenjie and Qin, Lu and Zhang, Ying},
title = {Efficient algorithms for reachability and path queries on temporal bipartite graphs},
journal = {The VLDB Journal},
year = {2024},
volume = {33},
number = {5},
pages = {1399--1426},
doi = {10.1007/s00778-024-00854-z}
}
EUVIMED