{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:16:14Z","timestamp":1759335374255,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319930398"},{"type":"electronic","value":"9783319930404"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-93040-4_51","type":"book-chapter","created":{"date-parts":[[2018,6,16]],"date-time":"2018-06-16T13:29:41Z","timestamp":1529155781000},"page":"651-663","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Tri-Fly: Distributed Estimation of Global and Local Triangle Counts in Graph Streams"],"prefix":"10.1007","author":[{"given":"Kijung","family":"Shin","sequence":"first","affiliation":[]},{"given":"Mohammad","family":"Hammoud","sequence":"additional","affiliation":[]},{"given":"Euiwoong","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Jinoh","family":"Oh","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,17]]},"reference":[{"key":"51_CR1","unstructured":"Supplementary document (2018). http:\/\/www.cs.cmu.edu\/~kijungs\/codes\/trifly\/supple.pdf"},{"key":"51_CR2","doi-asserted-by":"crossref","unstructured":"Ahmed, N.K., Duffield, N., Neville, J., Kompella, R.: Graph sample and hold: a framework for big-graph analytics. In: KDD (2014)","DOI":"10.1145\/2623330.2623757"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Arifuzzaman, S., Khan, M., Marathe, M.: PATRIC: a parallel algorithm for counting triangles in massive networks. In: CIKM (2013)","DOI":"10.1145\/2505515.2505545"},{"key":"51_CR4","unstructured":"Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Reductions in streaming algorithms, with an application to counting triangles in graphs. In: SODA (2002)"},{"issue":"3","key":"51_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1839490.1839494","volume":"4","author":"L Becchetti","year":"2010","unstructured":"Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient algorithms for large-scale local triangle counting. TKDD 4(3), 13 (2010)","journal-title":"TKDD"},{"issue":"4","key":"51_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/MCSE.2009.120","volume":"11","author":"J Cohen","year":"2009","unstructured":"Cohen, J.: Graph twiddling in a MapReduce world. Comput. Sci. Eng. 11(4), 29\u201341 (2009)","journal-title":"Comput. Sci. Eng."},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"De Stefani, L., Epasto, A., Riondato, M., Upfal, E.: TRIEST: counting local and global triangles in fully-dynamic streams with fixed memory size. In: KDD (2016)","DOI":"10.1145\/2939672.2939771"},{"issue":"9","key":"51_CR8","doi-asserted-by":"publisher","first-page":"5825","DOI":"10.1073\/pnas.032093399","volume":"99","author":"JP Eckmann","year":"2002","unstructured":"Eckmann, J.P., Moses, E.: Curvature of co-links uncovers hidden thematic layers in the world wide web. PNAS 99(9), 5825\u20135829 (2002)","journal-title":"PNAS"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Jha, M., Seshadhri, C., Pinar, A.: A space efficient streaming algorithm for triangle counting using the birthday paradox. In: KDD (2013)","DOI":"10.1145\/2487575.2487678"},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"Kutzkov, K., Pagh, R.: On the streaming complexity of computing local clustering coefficients. In: WSDM (2013)","DOI":"10.1145\/2433396.2433480"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Lim, Y., Kang, U.: MASCOT: memory-efficient and accurate sampling for counting local triangles in graph streams. In: KDD (2015)","DOI":"10.1145\/2783258.2783285"},{"key":"51_CR12","doi-asserted-by":"crossref","unstructured":"Park, H.M., Myaeng, S.H., Kang, U.: PTE: enumerating trillion triangles on distributed systems. In: KDD (2016)","DOI":"10.1145\/2939672.2939757"},{"key":"51_CR13","unstructured":"Pavan, A., Tangwongan, K., Tirthapura, S.: Parallel and distributed triangle counting on graph streams. Technical report, IBM (2013)"},{"issue":"14","key":"51_CR14","first-page":"1870","volume":"6","author":"A Pavan","year":"2013","unstructured":"Pavan, A., Tangwongsan, K., Tirthapura, S., Wu, K.L.: Counting and sampling triangles from a graph stream. PVLDB 6(14), 1870\u20131881 (2013)","journal-title":"PVLDB"},{"key":"51_CR15","doi-asserted-by":"crossref","unstructured":"Shin, K.: WRS: waiting room sampling for accurate triangle counting in real graph streams. In: ICDM (2017)","DOI":"10.1109\/ICDM.2017.143"},{"issue":"3","key":"51_CR16","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s10115-017-1077-6","volume":"54","author":"K Shin","year":"2018","unstructured":"Shin, K., Eliassi-Rad, T., Faloutsos, C.: Patterns and anomalies in k-cores of real-world graphs with applications. Knowl. Inf. Syst. 54(3), 677\u2013710 (2018)","journal-title":"Knowl. Inf. Syst."},{"key":"51_CR17","doi-asserted-by":"crossref","unstructured":"Suri, S., Vassilvitskii, S.: Counting triangles and the curse of the last reducer. In: WWW (2011)","DOI":"10.1145\/1963405.1963491"},{"key":"51_CR18","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E., Kang, U., Miller, G.L., Faloutsos, C.: DOULION: counting triangles in massive graphs with a coin. In: KDD (2009)","DOI":"10.1145\/1557019.1557111"},{"issue":"9","key":"51_CR19","first-page":"812","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. PVLDB 5(9), 812\u2013823 (2012)","journal-title":"PVLDB"},{"key":"51_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications, vol. 8. Cambridge University Press, Cambridge (1994)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93040-4_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:08:32Z","timestamp":1710324512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93040-4_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319930398","9783319930404"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93040-4_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/prada-research.net\/pakdd18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}