Efficiently Answering Minimum Reachable Label Set Queries in Edge-Labeled Graphs.
Yanping Wu|Renjie Sun|Chen Chen|Xiaoyang Wang|Xianming Fu
| Anthology ID: | DBLP:conf/cikm/WuS00F22 |
|---|---|
| Volume: | Proceedings of the 31st ACM International Conference on Information & Knowledge Management, Atlanta, GA, USA, October 17-21, 2022 |
| Year: | 2022 |
| Venue: | International Conference on Information and Knowledge Management (CIKM) |
| Publisher: | ACM |
| Pages: | 4585-4589 |
| URL: | https://doi.org/10.1145/3511808.3557593 |
| DOI: | https://doi.org/10.1145/3511808.3557593 |
| DBLP: | conf/cikm/WuS00F22 |
| BibTeX: |
@inproceedings{wu-2022-efficiently,
author = {Yanping Wu and
Renjie Sun and
Chen Chen and
Xiaoyang Wang and
Xianming Fu},
editor = {Mohammad Al Hasan and
Li Xiong},
title = {{Efficiently Answering Minimum Reachable Label Set Queries in Edge-Labeled Graphs}},
booktitle = {{Proceedings of the 31st ACM International Conference on Information & Knowledge Management, Atlanta, GA, USA, October 17-21, 2022}},
pages = {4585--4589},
publisher = {ACM},
year = {2022},
url = {https://doi.org/10.1145/3511808.3557593},
doi = {https://doi.org/10.1145/3511808.3557593}
}