HyperANF: approximating the neighbourhood function of very large graphs on a budget.

Paolo Boldi|Marco Rosa|Sebastiano Vigna


Anthology ID:DBLP:conf/www/BoldiRV11
Volume:Proceedings of the 20th International Conference on World Wide Web, WWW 2011, Hyderabad, India, March 28 - April 1, 2011
Year:2011
Venue:The Web Conference (WWW)
Publisher:ACM
Pages:625-634
URL:https://doi.org/10.1145/1963405.1963493
DOI:https://doi.org/10.1145/1963405.1963493
DBLP:conf/www/BoldiRV11
BibTeX:
@inproceedings{boldi-2011-hyperanf, author = {Paolo Boldi and Marco Rosa and Sebastiano Vigna}, editor = {Sadagopan Srinivasan and Krithi Ramamritham and Arun Kumar and M. P. Ravindra and Elisa Bertino and Ravi Kumar}, title = {{HyperANF: approximating the neighbourhood function of very large graphs on a budget}}, booktitle = {{Proceedings of the 20th International Conference on World Wide Web, WWW 2011, Hyderabad, India, March 28 - April 1, 2011}}, pages = {625--634}, publisher = {ACM}, year = {2011}, url = {https://doi.org/10.1145/1963405.1963493}, doi = {https://doi.org/10.1145/1963405.1963493} }