Efficient and Effective Similarity Search over Bipartite Graphs.
| Anthology ID: | DBLP:conf/www/Yang22 |
|---|---|
| Volume: | WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25 - 29, 2022 |
| Year: | 2022 |
| Venue: | The Web Conference (WWW) |
| Publisher: | ACM |
| Pages: | 308-318 |
| URL: | https://doi.org/10.1145/3485447.3511959 |
| DOI: | https://doi.org/10.1145/3485447.3511959 |
| DBLP: | conf/www/Yang22 |
| BibTeX: |
@inproceedings{yang-2022-efficient,
author = {Renchi Yang},
editor = {Fr\'{e}d\'{e}rique Laforest and
Rapha\"{e}l Troncy and
Elena Simperl and
Deepak Agarwal and
Aristides Gionis and
Ivan Herman and
Lionel M\'{e}dini},
title = {{Efficient and Effective Similarity Search over Bipartite Graphs}},
booktitle = {{WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25 - 29, 2022}},
pages = {308--318},
publisher = {ACM},
year = {2022},
url = {https://doi.org/10.1145/3485447.3511959},
doi = {https://doi.org/10.1145/3485447.3511959}
}