{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:40:03Z","timestamp":1750196403424,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,18]],"date-time":"2020-10-18T00:00:00Z","timestamp":1602979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100008952","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["AAPG2019"],"award-info":[{"award-number":["AAPG2019"]}],"id":[{"id":"10.13039\/501100008952","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"DOI":"10.1145\/3412815.3416884","type":"proceedings-article","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T23:37:54Z","timestamp":1602805074000},"page":"107-117","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Large Very Dense Subgraphs in a Stream of Edges"],"prefix":"10.1145","author":[{"given":"Claire","family":"Mathieu","sequence":"first","affiliation":[{"name":"CNRS & IRIF, Paris, France"}]},{"given":"Michel","family":"de Rougemont","sequence":"additional","affiliation":[{"name":"University Paris II & IRIF, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2020,10,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Aggarwal and Haixun Wang. Managing and Mining Graph Data","author":"Charu","year":"2010","unstructured":"Charu C. Aggarwal and Haixun Wang. Managing and Mining Graph Data . Springer Publishing Company, Inc orporated, 1st edition, 2010 . Charu C. Aggarwal and Haixun Wang. Managing and Mining Graph Data. Springer Publishing Company, Incorporated, 1st edition, 2010."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/10586458.2001.10504428"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.85.5234"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/545381.545465"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"e_1_3_2_1_7_1","first-page":"509","volume-title":"Science 286","author":"Barabasi A.","year":"1999","unstructured":"A. Barabasi and R. Albert . The emergence of scaling in random networks . In Science 286 , pages 509 -- 512 , 1999 . A. Barabasi and R.Albert. The emergence of scaling in random networks. In Science 286, pages 509--512, 1999."},{"key":"e_1_3_2_1_8_1","volume-title":"Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. CoRR, abs\/1504.02268","author":"Bhattacharya Sayan","year":"2015","unstructured":"Sayan Bhattacharya , Monika Henzinger , Danupon Nanongkai , and Charalampos E. Tsourakakis . Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. CoRR, abs\/1504.02268 , 2015 . Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, and Charalampos E. Tsourakakis. Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. CoRR, abs\/1504.02268, 2015."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559818"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214414"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10390644"},{"key":"e_1_3_2_1_12_1","first-page":"1101","volume-title":"IEEE International Conference on Big Data","author":"de Rougemont M.","year":"2018","unstructured":"M. de Rougemont and G. Vimont . The content correlation of streaming edges . In IEEE International Conference on Big Data , pages 1101 -- 1106 , 2018 . M. de Rougemont and G. Vimont. The content correlation of streaming edges. In IEEE International Conference on Big Data, pages 1101--1106, 2018."},{"key":"e_1_3_2_1_13_1","volume-title":"Algorithms and Theory of Computation Handbook.","author":"Demetrescu Camil","year":"2010","unstructured":"Camil Demetrescu , David Eppstein , Zvi Galil , and Giuseppe F. Italiano . Dynamic graph algorithms . In Mikhail J. Atallah and Marina Blanton, editors, Algorithms and Theory of Computation Handbook. 2010 . Camil Demetrescu, David Eppstein, Zvi Galil, and Giuseppe F. Italiano. Dynamic graph algorithms. In Mikhail J. Atallah and Marina Blanton, editors, Algorithms and Theory of Computation Handbook. 2010."},{"issue":"155","key":"e_1_3_2_1_14_1","first-page":"168","article-title":"Anatomy of the giant component: The strictly supercritical regime","volume":"35","author":"Ding Jian","year":"2014","unstructured":"Jian Ding , Eyal Lubetzky , and Yuval Peres . Anatomy of the giant component: The strictly supercritical regime . European Journal of Combinatorics , 35 : 155 -- 168 , 2014 . Jian Ding, Eyal Lubetzky, and Yuval Peres. Anatomy of the giant component: The strictly supercritical regime. European Journal of Combinatorics, 35:155 -- 168, 2014.","journal-title":"European Journal of Combinatorics"},{"key":"e_1_3_2_1_15_1","volume-title":"Statistical, nonlinear, and soft matter physics, 64:026118, 09","author":"Newman Mark E.J.","year":"2001","unstructured":"Mark E.J. Newman , Steven H. Strogatz , and Duncan Watts . Random graphs with arbitrary degree distributions and their applications. Physical review. E , Statistical, nonlinear, and soft matter physics, 64:026118, 09 2001 . Mark E.J. Newman, Steven H. Strogatz, and Duncan Watts. Random graphs with arbitrary degree distributions and their applications. Physical review. E, Statistical, nonlinear, and soft matter physics, 64:026118, 09 2001."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741638"},{"key":"e_1_3_2_1_17_1","first-page":"17","volume-title":"Publication of the mathematical institute of the Hungarian Academy of Sciences","author":"Erd\u00f6s P.","year":"1960","unstructured":"P. Erd\u00f6s and A Renyi . On the evolution of random graphs . In Publication of the mathematical institute of the Hungarian Academy of Sciences , pages 17 -- 61 , 1960 . P. Erd\u00f6s and A Renyi. On the evolution of random graphs. In Publication of the mathematical institute of the Hungarian Academy of Sciences, pages 17--61, 1960."},{"key":"e_1_3_2_1_18_1","first-page":"264","article-title":"Gr\u00e1fok el\u00edrt foksz\u00e1m\u00fa pontokkal","volume":"11","author":"Erd's P.","year":"1960","unstructured":"P. Erd's and T. Gallai . Gr\u00e1fok el\u00edrt foksz\u00e1m\u00fa pontokkal . Matematikai Lapok , 11 : 264 -- 274 , 1960 . P. Erd's and T. Gallai. Gr\u00e1fok el\u00edrt foksz\u00e1m\u00fa pontokkal. Matematikai Lapok, 11:264--274, 1960.","journal-title":"Matematikai Lapok"},{"key":"e_1_3_2_1_19_1","volume-title":"Applications of uniform sampling: Densest subgraph and beyond. CoRR, abs\/1506.04505","author":"Esfandiari Hossein","year":"2015","unstructured":"Hossein Esfandiari , MohammadTaghi Hajiaghayi , and David P. Woodruff . Applications of uniform sampling: Densest subgraph and beyond. CoRR, abs\/1506.04505 , 2015 . Hossein Esfandiari, MohammadTaghi Hajiaghayi, and David P. Woodruff. Applications of uniform sampling: Densest subgraph and beyond. CoRR, abs\/1506.04505, 2015."},{"key":"e_1_3_2_1_20_1","first-page":"627","volume-title":"Proceedings of the 37th Annual Symposium on Foundations of Computer Science, FOCS '96","author":"Hastad J.","unstructured":"J. Hastad . Clique is hard to approximate within $n^1-\u03b5$ . In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, FOCS '96 , pages 627 --. IEEE Computer Society, 1996. J. Hastad. Clique is hard to approximate within $n^1-\u03b5$. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, FOCS '96, pages 627--. IEEE Computer Society, 1996."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48686-0_1"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892065"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/264772"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_26_1","volume-title":"Densest subgraph in dynamic graph streams. CoRR, abs\/1506.04417","author":"McGregor Andrew","year":"2015","unstructured":"Andrew McGregor , David Tench , Sofya Vorotnikova , and Hoa T. Vu . Densest subgraph in dynamic graph streams. CoRR, abs\/1506.04417 , 2015 . Andrew McGregor, David Tench, Sofya Vorotnikova, and Hoa T. Vu. Densest subgraph in dynamic graph streams. CoRR, abs\/1506.04417, 2015."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548398003526"},{"issue":"3","key":"e_1_3_2_1_28_1","first-page":"342","article-title":"Statistics of social configurations","volume":"1","author":"Moreno J. L.","year":"1938","unstructured":"J. L. Moreno and H. H. Jennings . Statistics of social configurations . JSTOR , 1 ( 3\/4 ): 342 -- 374 , 1938 . J. L. Moreno and H. H. Jennings. Statistics of social configurations. JSTOR, 1(3\/4):342--374, 1938.","journal-title":"JSTOR"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"Newman Mark","year":"2010","unstructured":"Mark Newman . Networks: An Introduction . Oxford University Press, Inc. , 2010 . Mark Newman. Networks: An Introduction. Oxford University Press, Inc., 2010."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.09.005"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1086\/518527"}],"event":{"name":"FODS '20: ACM-IMS Foundations of Data Science Conference","acronym":"FODS '20","location":"Virtual Event USA"},"container-title":["Proceedings of the 2020 ACM-IMS on Foundations of Data Science Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3412815.3416884","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3412815.3416884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:25:02Z","timestamp":1750195502000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3412815.3416884"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,18]]},"references-count":32,"alternative-id":["10.1145\/3412815.3416884","10.1145\/3412815"],"URL":"https:\/\/doi.org\/10.1145\/3412815.3416884","relation":{},"subject":[],"published":{"date-parts":[[2020,10,18]]},"assertion":[{"value":"2020-10-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}