Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs.
Xiaofeng Yang|Deepak Ajwani|Wolfgang Gatterbauer|Patrick K. Nicholson|Mirek Riedewald|Alessandra Sala
| Anthology ID: | DBLP:conf/www/YangAGNRS18 |
|---|---|
| Volume: | Proceedings of the 2018 World Wide Web Conference on World Wide Web, WWW 2018, Lyon, France, April 23-27, 2018 |
| Year: | 2018 |
| Venue: | The Web Conference (WWW) |
| Publisher: | ACM |
| Pages: | 489-498 |
| URL: | https://doi.org/10.1145/3178876.3186115 |
| DOI: | https://doi.org/10.1145/3178876.3186115 |
| DBLP: | conf/www/YangAGNRS18 |
| BibTeX: |
@inproceedings{yang-2018-anyk,
author = {Xiaofeng Yang and
Deepak Ajwani and
Wolfgang Gatterbauer and
Patrick K. Nicholson and
Mirek Riedewald and
Alessandra Sala},
editor = {Pierre-Antoine Champin and
Fabien Gandon and
Mounia Lalmas-Roelleke and
Panagiotis G. Ipeirotis},
title = {{Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs}},
booktitle = {{Proceedings of the 2018 World Wide Web Conference on World Wide Web, WWW 2018, Lyon, France, April 23-27, 2018}},
pages = {489--498},
publisher = {ACM},
year = {2018},
url = {https://doi.org/10.1145/3178876.3186115},
doi = {https://doi.org/10.1145/3178876.3186115}
}