Efficient processing of k-hop reachability queries on temporal bipartite graphs.
Junfeng Zhou|Zuyong Wang|Yuting Tan|Ming Du|Ziyang Chen|Xian Tang
| Anthology ID: | DBLP:journals/ipm/ZhouWTDCT25 |
|---|---|
| Year: | 2025 |
| Venue: | Information Processing and Management |
| Pages: | 104178 |
| URL: | https://doi.org/10.1016/J.IPM.2025.104178 |
| DOI: | https://doi.org/10.1016/J.IPM.2025.104178 |
| DBLP: | journals/ipm/ZhouWTDCT25 |
| BibTeX: |
@article{zhou-2025-efficient,
author = {Junfeng Zhou and
Zuyong Wang and
Yuting Tan and
Ming Du and
Ziyang Chen and
Xian Tang},
title = {{Efficient processing of k-hop reachability queries on temporal bipartite graphs}},
journal = {Information Processing and Management},
volume = {62},
number = {5},
pages = {104178},
year = {2025},
url = {https://doi.org/10.1016/J.IPM.2025.104178},
doi = {https://doi.org/10.1016/J.IPM.2025.104178}
}