Crossmark

Efficient algorithms for reachability and path queries on temporal bipartite graphs

Crossref DOI link: https://doi.org/10.1007/s00778-024-00854-z

Published Online: 2024-05-23

Published Print: 2024-09

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Wang, Kai

Cai, Minghao

Chen, Xiaoshuang https://orcid.org/0000-0002-8988-7933
Lin, Xuemin

Zhang, Wenjie

Qin, Lu

Zhang, Ying
License Information

Text and Data Mining valid from 2024-05-23

Version of Record valid from 2024-05-23
More Information

Article History

Received: 22 August 2023

Revised: 18 January 2024

Accepted: 17 April 2024

First Online: 23 May 2024