Efficient algorithms for reachability and path queries on temporal bipartite graphs.

MLA

Wang, Kai, et al. “Efficient Algorithms for Reachability and Path Queries on Temporal Bipartite Graphs.” VLDB Journal International Journal on Very Large Data Bases, vol. 33, no. 5, Sept. 2024, pp. 1399–426. EBSCOhost, https://doi.org/10.1007/s00778-024-00854-z.

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. VLDB Journal International Journal on Very Large Data Bases, 33(5), 1399–1426. https://doi.org/10.1007/s00778-024-00854-z

Chicago

Wang, Kai, Minghao Cai, Xiaoshuang Chen, Xuemin Lin, Wenjie Zhang, Lu Qin, and Ying Zhang. 2024. “Efficient Algorithms for Reachability and Path Queries on Temporal Bipartite Graphs.” VLDB Journal International Journal on Very Large Data Bases 33 (5): 1399–1426. doi:10.1007/s00778-024-00854-z.