{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T20:21:40Z","timestamp":1768681300356,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T00:00:00Z","timestamp":1485993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003407","name":"Ministero dell'Istruzione, dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["SIR Grant RBSI14Q743"],"award-info":[{"award-number":["SIR Grant RBSI14Q743"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","award":["Focused Research Award"],"award-info":[{"award-number":["Focused Research Award"]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["Starting Grant DMAP 680153"],"award-info":[{"award-number":["Starting Grant DMAP 680153"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004271","name":"Sapienza Universit\u00e0 di Roma","doi-asserted-by":"publisher","award":["Grant C26M15ALKP"],"award-info":[{"award-number":["Grant C26M15ALKP"]}],"id":[{"id":"10.13039\/501100004271","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,2,2]]},"DOI":"10.1145\/3018661.3018732","type":"proceedings-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T20:09:48Z","timestamp":1486066188000},"page":"557-566","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":54,"title":["Counting Graphlets"],"prefix":"10.1145","author":[{"given":"Marco","family":"Bressan","sequence":"first","affiliation":[{"name":"Sapienza University of Rome, Roma, Italy"}]},{"given":"Flavio","family":"Chierichetti","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Roma, Italy"}]},{"given":"Ravi","family":"Kumar","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Stefano","family":"Leucci","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Roma, Italy"}]},{"given":"Alessandro","family":"Panconesi","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Roma, Italy"}]}],"member":"320","published-online":{"date-parts":[[2017,2,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210337"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.87"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1145\/988672.988752","volume-title":"WWW","author":"Boldi P.","year":"2004","unstructured":"P. Boldi and S. Vigna . The WebGraph framework I: Compression techniques . In WWW , pages 595 -- 601 , 2004 . P. Boldi and S. Vigna. The WebGraph framework I: Compression techniques. In WWW, pages 595--601, 2004."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.122"},{"key":"e_1_3_2_1_6_1","volume-title":"A general framework for estimating graphlet statistics via random walk. CoRR, abs\/1603.07504","author":"Chen X.","year":"2016","unstructured":"X. Chen , Y. Li , P. Wang , and J. C. S. Lui . A general framework for estimating graphlet statistics via random walk. CoRR, abs\/1603.07504 , 2016 . X. Chen, Y. Li, P. Wang, and J. C. S. Lui. A general framework for estimating graphlet statistics via random walk. CoRR, abs\/1603.07504, 2016."},{"key":"e_1_3_2_1_7_1","volume-title":"ICCM","author":"Chung F.","year":"2007","unstructured":"F. Chung . Four proofs for the Cheeger inequality and graph partition algorithms . In ICCM , 2007 . F. Chung. Four proofs for the Cheeger inequality and graph partition algorithms. In ICCM, 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/140978211"},{"key":"e_1_3_2_1_9_1","volume-title":"Waddling random walk: Fast and accurate sampling of motif statistics in large graphs. CoRR, abs\/1605.09776","author":"Han G.","year":"2016","unstructured":"G. Han and H. Sethu . Waddling random walk: Fast and accurate sampling of motif statistics in large graphs. CoRR, abs\/1605.09776 , 2016 . G. Han and H. Sethu. Waddling random walk: Fast and accurate sampling of motif statistics in large graphs. CoRR, abs\/1605.09776, 2016."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.11.015"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487678"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741101"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367591"},{"key":"e_1_3_2_1_14_1","volume-title":"Markov Chains and Mixing Times","author":"Levin D. A.","year":"2009","unstructured":"D. A. Levin , Y. Peres , and E. L. Wilmer . Markov Chains and Mixing Times . American Mathematical Society , 2009 . D. A. Levin, Y. Peres, and E. L. Wilmer. Markov Chains and Mixing Times. American Mathematical Society, 2009."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2013.30"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963491"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms3241"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557111"},{"key":"e_1_3_2_1_20_1","volume-title":"Graph Theory","author":"Tutte W. T.","year":"2001","unstructured":"W. T. Tutte . Graph Theory . Cambridge University Press , 2001 . W. T. Tutte. Graph Theory. Cambridge University Press, 2001."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592665.1592675"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629564"},{"key":"e_1_3_2_1_23_1","volume-title":"Moss: A scalable tool for efficiently sampling and counting 4- and 5-node graphlets. CoRR, abs\/1509.08089","author":"Wang P.","year":"2015","unstructured":"P. Wang , J. Tao , J. Zhao , and X. Guan . Moss: A scalable tool for efficiently sampling and counting 4- and 5-node graphlets. CoRR, abs\/1509.08089 , 2015 . P. Wang, J. Tao, J. Zhao, and X. Guan. Moss: A scalable tool for efficiently sampling and counting 4- and 5-node graphlets. CoRR, abs\/1509.08089, 2015."},{"key":"e_1_3_2_1_24_1","volume-title":"A fast sampling method of exploring graphlet degrees of large directed and undirected graphs. ArXiv e-prints","author":"Wang P.","year":"2016","unstructured":"P. Wang , X. Zhang , Z. Li , J. Cheng , J. C. S. Lui , D. Towsley , J. Zhao , J. Tao , and X. Guan . A fast sampling method of exploring graphlet degrees of large directed and undirected graphs. ArXiv e-prints , 2016 . P. Wang, X. Zhang, Z. Li, J. Cheng, J. C. S. Lui, D. Towsley, J. Zhao, J. Tao, and X. Guan. A fast sampling method of exploring graphlet degrees of large directed and undirected graphs. ArXiv e-prints, 2016."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/09076619X"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2010.67"}],"event":{"name":"WSDM 2017: Tenth ACM International Conference on Web Search and Data Mining","location":"Cambridge United Kingdom","acronym":"WSDM 2017","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the Tenth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3018661.3018732","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3018661.3018732","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:09Z","timestamp":1750220649000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3018661.3018732"}},"subtitle":["Space vs Time"],"short-title":[],"issued":{"date-parts":[[2017,2,2]]},"references-count":26,"alternative-id":["10.1145\/3018661.3018732","10.1145\/3018661"],"URL":"https:\/\/doi.org\/10.1145\/3018661.3018732","relation":{},"subject":[],"published":{"date-parts":[[2017,2,2]]},"assertion":[{"value":"2017-02-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}