{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T17:17:05Z","timestamp":1780766225299,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,3]],"date-time":"2019-11-03T00:00:00Z","timestamp":1572739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1725702"],"award-info":[{"award-number":["1725702"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1527541"],"award-info":[{"award-number":["1527541"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,3]]},"DOI":"10.1145\/3357384.3357983","type":"proceedings-article","created":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T14:11:35Z","timestamp":1572876695000},"page":"1201-1210","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["FLEET"],"prefix":"10.1145","author":[{"given":"Seyed-Vahid","family":"Sanei-Mehri","sequence":"first","affiliation":[{"name":"Iowa State University, Ames, IA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Iowa State University, Ames, IA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahmet Erdem","family":"Sariy\u00fcce","sequence":"additional","affiliation":[{"name":"University at Buffalo, Buffalo, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Srikanta","family":"Tirthapura","sequence":"additional","affiliation":[{"name":"Iowa State University, Ames, IA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13129-0_16"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137651"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.141"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnx001"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"e_1_3_2_1_6_1","unstructured":"B. Babcock M. Datar and R. Motwani. 2002. Sampling from a Moving Window over Streaming Data. In SODA .  B. Babcock M. Datar and R. Motwani. 2002. Sampling from a Moving Window over Streaming Data. In SODA ."},{"key":"e_1_3_2_1_7_1","volume-title":"Efficient algorithms for large-scale local triangle counting. ACM Transactions on Knowledge Discovery from Data (TKDD)","author":"Becchetti Luca","year":"2010","unstructured":"Luca Becchetti , Paolo Boldi , Carlos Castillo , and Aristides Gionis . 2010. Efficient algorithms for large-scale local triangle counting. ACM Transactions on Knowledge Discovery from Data (TKDD) , Vol. 4 , 3 ( 2010 ), 13. Luca Becchetti, Paolo Boldi, Carlos Castillo, and Aristides Gionis. 2010. Efficient algorithms for large-scale local triangle counting. ACM Transactions on Knowledge Discovery from Data (TKDD) , Vol. 4, 3 (2010), 13."},{"key":"e_1_3_2_1_8_1","volume-title":"34th Symposium on Theoretical Aspects of Computer Science (STACS","author":"Bera Suman K","year":"2017","unstructured":"Suman K Bera and Amit Chakrabarti . 2017 . Towards tighter space bounds for counting triangles and other substructures in graph streams . In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Suman K Bera and Amit Chakrabarti. 2017. Towards tighter space bounds for counting triangles and other substructures in graph streams. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.109"},{"key":"e_1_3_2_1_10_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Braverman Vladimir","unstructured":"Vladimir Braverman , Rafail Ostrovsky , and Dan Vilenchik . 2013. How hard is counting triangles in the streaming model? . In International Colloquium on Automata, Languages, and Programming . Springer , 244--254. Vladimir Braverman, Rafail Ostrovsky, and Dan Vilenchik. 2013. How hard is counting triangles in the streaming model?. In International Colloquium on Automata, Languages, and Programming. Springer, 244--254."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559818"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0036-4"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75520-3_55"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3110025.3110042"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.06.020"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557051"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu089"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564880"},{"key":"e_1_3_2_1_19_1","volume-title":"Proof of a conjecture of P. Erdos. Combinatorial theory and its applications","author":"Hajnal Andr\u00e1s","year":"1970","unstructured":"Andr\u00e1s Hajnal and Endre Szemer\u00e9di . 1970. Proof of a conjecture of P. Erdos. Combinatorial theory and its applications , Vol. 2 ( 1970 ), 601--623. Andr\u00e1s Hajnal and Endre Szemer\u00e9di. 1970. Proof of a conjecture of P. Erdos. Combinatorial theory and its applications , Vol. 2 (1970), 601--623."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3110025.3110061"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741101"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/11533719_72"},{"key":"e_1_3_2_1_23_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Kane Daniel M","unstructured":"Daniel M Kane , Kurt Mehlhorn , Thomas Sauerwald , and He Sun . 2012. Counting arbitrary subgraphs in data streams . In International Colloquium on Automata, Languages, and Programming . Springer , 598--609. Daniel M Kane, Kurt Mehlhorn, Thomas Sauerwald, and He Sun. 2012. Counting arbitrary subgraphs in data streams. In International Colloquium on Automata, Languages, and Programming. Springer, 598--609."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2012.625260"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_1_26_1","first-page":"1189","article-title":"Query-URL Bipartite Based Approach to Personalized Query Recommendation","volume":"8","author":"Li Lin","year":"2008","unstructured":"Lin Li , Zhenglu Yang , Ling Liu , and Masaru Kitsuregawa . 2008 . Query-URL Bipartite Based Approach to Personalized Query Recommendation .. In AAAI , Vol. 8. 1189 -- 1194 . Lin Li, Zhenglu Yang, Ling Liu, and Masaru Kitsuregawa. 2008. Query-URL Bipartite Based Approach to Personalized Query Recommendation.. In AAAI , Vol. 8. 1189--1194.","journal-title":"AAAI"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783285"},{"key":"e_1_3_2_1_28_1","volume-title":"Cycles and clustering in bipartite networks. Physical review E","author":"Lind Pedro G","year":"2005","unstructured":"Pedro G Lind , Marta C Gonzalez , and Hans J Herrmann . 2005. Cycles and clustering in bipartite networks. Physical review E , Vol. 72 , 5 ( 2005 ), 056127. Pedro G Lind, Marta C Gonzalez, and Hans J Herrmann. 2005. Cycles and clustering in bipartite networks. Physical review E , Vol. 72, 5 (2005), 056127."},{"key":"e_1_3_2_1_29_1","volume-title":"The World Wide Web Conference. ACM, 1130--1141","author":"Liu Boge","year":"2019","unstructured":"Boge Liu , Long Yuan , Xuemin Lin , Lu Qin , Wenjie Zhang , and Jingren Zhou . 2019 . Efficient (a)-core Computation: an Index-based Approach . In The World Wide Web Conference. ACM, 1130--1141 . Boge Liu, Long Yuan, Xuemin Lin, Lu Qin, Wenjie Zhang, and Jingren Zhou. 2019. Efficient (a)-core Computation: an Index-based Approach. In The World Wide Web Conference. ACM, 1130--1141."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23719-5_57"},{"key":"e_1_3_2_1_31_1","volume-title":"Foundations and Trends\u00ae in Theoretical Computer Science","volume":"8","author":"Mehta Aranyak","year":"2013","unstructured":"Aranyak Mehta . 2013 . Online matching and ad allocation . Foundations and Trends\u00ae in Theoretical Computer Science , Vol. 8 , 4 (2013), 265--368. Aranyak Mehta. 2013. Online matching and ad allocation. Foundations and Trends\u00ae in Theoretical Computer Science , Vol. 8, 4 (2013), 265--368."},{"key":"e_1_3_2_1_32_1","volume-title":"Uncovering biological network function via graphlet degree signatures. Cancer informatics","author":"Milenkovic Tijana","year":"2008","unstructured":"Tijana Milenkovic and Natavs a Prvzulj . 2008. Uncovering biological network function via graphlet degree signatures. Cancer informatics , Vol. 6 ( 2008 ), CIN--S 680. Tijana Milenkovic and Natavs a Prvzulj. 2008. Uncovering biological network function via graphlet degree signatures. Cancer informatics , Vol. 6 (2008), CIN--S680."},{"key":"e_1_3_2_1_33_1","volume-title":"Science","volume":"298","author":"Milo Ron","year":"2002","unstructured":"Ron Milo , Shai Shen-Orr , Shalev Itzkovitz , Nadav Kashtan , Dmitri Chklovskii , and Uri Alon . 2002 . Network motifs: simple building blocks of complex networks . Science , Vol. 298 , 5594 (2002), 824--827. Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii, and Uri Alon. 2002. Network motifs: simple building blocks of complex networks. Science , Vol. 298, 5594 (2002), 824--827."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.007"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556569"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1093\/gigascience\/giy014"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052597"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl301"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:CMOT.0000032580.12184.c0"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220097"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159678"},{"key":"e_1_3_2_1_42_1","unstructured":"Doris Schi\u00f6berg Fabian Schneider Stefan Schmid Steve Uhlig and Anja Feldmann. 2015. Evolution of directed triangle motifs in the google  Doris Schi\u00f6berg Fabian Schneider Stefan Schmid Steve Uhlig and Anja Feldmann. 2015. Evolution of directed triangle motifs in the google"},{"key":"e_1_3_2_1_43_1","volume-title":"arXiv preprint arXiv:1502.04321","year":"2015","unstructured":"osn. arXiv preprint arXiv:1502.04321 ( 2015 ). osn. arXiv preprint arXiv:1502.04321 (2015)."},{"key":"e_1_3_2_1_44_1","volume-title":"Parallel Algorithms for Butterfly Computations. arXiv preprint arXiv:1907.08607","author":"Shi Jessica","year":"2019","unstructured":"Jessica Shi and Julian Shun . 2019. Parallel Algorithms for Butterfly Computations. arXiv preprint arXiv:1907.08607 ( 2019 ). Jessica Shi and Julian Shun. 2019. Parallel Algorithms for Butterfly Computations. arXiv preprint arXiv:1907.08607 (2019)."},{"key":"e_1_3_2_1_45_1","volume-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 141--157","author":"Shin Kijung","year":"2018","unstructured":"Kijung Shin , Jisu Kim , Bryan Hooi , and Christos Faloutsos . 2018 . Think before you discard: Accurate triangle counting in graph streams with deletions . In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 141--157 . Kijung Shin, Jisu Kim, Bryan Hooi, and Christos Faloutsos. 2018. Think before you discard: Accurate triangle counting in graph streams with deletions. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 141--157."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsos.140306"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3059194"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505741"},{"key":"e_1_3_2_1_49_1","volume-title":"Revisiting Wedge Sampling for Triangle Counting. In The World Wide Web Conference. ACM","author":"Turk Ata","year":"2019","unstructured":"Ata Turk and Duru Turkoglu . 2019 . Revisiting Wedge Sampling for Triangle Counting. In The World Wide Web Conference. ACM , 1875--1885. Ata Turk and Duru Turkoglu. 2019. Revisiting Wedge Sampling for Triangle Counting. In The World Wide Web Conference. ACM, 1875--1885."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.Congress.2014.13"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339497"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.14778\/3149193.3149197"},{"key":"e_1_3_2_1_53_1","volume-title":"Proc. SODA .","author":"Bar-Yossef R. Kumar Z.","unstructured":"R. Kumar Z. Bar-Yossef and D. Sivakumar . 2002. Reductions in streaming algorithms, with an application to counting triangles in graphs . In Proc. SODA . R. Kumar Z. Bar-Yossef and D. Sivakumar. 2002. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proc. SODA ."},{"key":"e_1_3_2_1_54_1","volume-title":"Fast Rectangle Counting on Massive Networks. In 2018 IEEE International Conference on Data Mining (ICDM). IEEE, 847--856","author":"Zhu Rong","year":"2018","unstructured":"Rong Zhu , Zhaonian Zou , and Jianzhong Li . 2018 . Fast Rectangle Counting on Massive Networks. In 2018 IEEE International Conference on Data Mining (ICDM). IEEE, 847--856 . Rong Zhu, Zhaonian Zou, and Jianzhong Li. 2018. Fast Rectangle Counting on Massive Networks. In 2018 IEEE International Conference on Data Mining (ICDM). IEEE, 847--856."}],"event":{"name":"CIKM '19: The 28th ACM International Conference on Information and Knowledge Management","location":"Beijing China","acronym":"CIKM '19","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 28th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3357983","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357384.3357983","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357384.3357983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:04Z","timestamp":1750202584000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3357983"}},"subtitle":["Butterfly Estimation from a Bipartite Graph Stream"],"short-title":[],"issued":{"date-parts":[[2019,11,3]]},"references-count":54,"alternative-id":["10.1145\/3357384.3357983","10.1145\/3357384"],"URL":"https:\/\/doi.org\/10.1145\/3357384.3357983","relation":{},"subject":[],"published":{"date-parts":[[2019,11,3]]},"assertion":[{"value":"2019-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}