Raising Graphs From Randomness to Reveal Information Networks.

Róbert Pálovics|András A. Benczúr


Anthology ID:DBLP:conf/wsdm/PalovicsB17
Volume:Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, WSDM 2017, Cambridge, United Kingdom, February 6-10, 2017
Year:2017
Venue:Web Search and Data Mining (WSDM)
Publisher:ACM
Pages:23-32
URL:https://doi.org/10.1145/3018661.3018664
DOI:https://doi.org/10.1145/3018661.3018664
DBLP:conf/wsdm/PalovicsB17
BibTeX:
@inproceedings{palovics-2017-raising, author = {R\'{o}bert P\'{a}lovics and Andr\'{a}s A. Bencz\'{u}r}, editor = {Maarten de Rijke and Milad Shokouhi and Andrew Tomkins and Min Zhang}, title = {{Raising Graphs From Randomness to Reveal Information Networks}}, booktitle = {{Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, WSDM 2017, Cambridge, United Kingdom, February 6-10, 2017}}, pages = {23--32}, publisher = {ACM}, year = {2017}, url = {https://doi.org/10.1145/3018661.3018664}, doi = {https://doi.org/10.1145/3018661.3018664} }