{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T11:07:35Z","timestamp":1770548855865,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:00:00Z","timestamp":1587340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,4,20]]},"DOI":"10.1145\/3366423.3380033","type":"proceedings-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T08:16:51Z","timestamp":1588580211000},"page":"2747-2753","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Deconstruct Densest Subgraphs"],"prefix":"10.1145","author":[{"given":"Lijun","family":"Chang","sequence":"first","affiliation":[{"name":"The University of Sydney"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miao","family":"Qiao","sequence":"additional","affiliation":[{"name":"The University of Auckland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n.d.]. full version https:\/\/lijunchang.github.io\/pdf\/dds.pdf.  [n.d.]. full version https:\/\/lijunchang.github.io\/pdf\/dds.pdf."},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. of CIKM\u201913","author":"Akiba T.","unstructured":"T. Akiba , Y. Iwata , and Y. Yoshida . 2013. Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction . In Proc. of CIKM\u201913 . T. Akiba, Y. Iwata, and Y. Yoshida. 2013. Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction. In Proc. of CIKM\u201913."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/2168651.2168658"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. of WSDM\u201915","author":"Balalau D.","unstructured":"O.\u00a0 D. Balalau , F. Bonchi , T.-H.\u00a0 H. Chan , F. Gullo , and M. Sozio . 2015. Finding Subgraphs with Maximum Total Density and Limited Overlap . In Proc. of WSDM\u201915 . 379\u2013388. O.\u00a0D. Balalau, F. Bonchi, T.-H.\u00a0H. Chan, F. Gullo, and M. Sozio. 2015. Finding Subgraphs with Maximum Total Density and Limited Overlap. In Proc. of WSDM\u201915. 379\u2013388."},{"key":"e_1_3_2_1_6_1","unstructured":"V. Batagelj and M. Zaversnik. 2003. An O(m) Algorithm for Cores Decomposition of Networks. CoRR (2003).  V. Batagelj and M. Zaversnik. 2003. An O(m) Algorithm for Cores Decomposition of Networks. CoRR (2003)."},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. of WWW\u201913","author":"Beutel A.","unstructured":"A. Beutel , W. Xu , V. Guruswami , C. Palow , and C. Faloutsos . 2013. CopyCatch: stopping group attacks by spotting lockstep behavior in social networks . In Proc. of WWW\u201913 . 119\u2013130. A. Beutel, W. Xu, V. Guruswami, C. Palow, and C. Faloutsos. 2013. CopyCatch: stopping group attacks by spotting lockstep behavior in social networks. In Proc. of WWW\u201913. 119\u2013130."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746592"},{"key":"e_1_3_2_1_9_1","volume-title":"Graph Theory, 1736-1936","author":"Biggs N.","unstructured":"N. Biggs , E.\u00a0 K. Lloyd , and R.\u00a0 J. Wilson . 1986. Graph Theory, 1736-1936 . Clarendon Press . N. Biggs, E.\u00a0K. Lloyd, and R.\u00a0J. Wilson. 1986. Graph Theory, 1736-1936. Clarendon Press."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330986"},{"key":"e_1_3_2_1_12_1","series-title":"Springer Series in the Data Sciences","volume-title":"Cohesive Subgraph Computation over Large Sparse Graphs","author":"Chang Lijun","unstructured":"Lijun Chang and Lu Qin . 2018. Cohesive Subgraph Computation over Large Sparse Graphs . Springer Series in the Data Sciences . Lijun Chang and Lu Qin. 2018. Cohesive Subgraph Computation over Large Sparse Graphs. Springer Series in the Data Sciences."},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. of SIGMOD\u201913","author":"Chang L.","unstructured":"L. Chang , J.\u00a0 X. Yu , L. Q., X. Lin , C. Liu , and W. Liang . 2013. Efficiently computing k-edge connected components via graph decomposition . In Proc. of SIGMOD\u201913 . L. Chang, J.\u00a0X. Yu, L. Q., X. Lin, C. Liu, and W. Liang. 2013. Efficiently computing k-edge connected components via graph decomposition. In Proc. of SIGMOD\u201913."},{"key":"e_1_3_2_1_14_1","volume-title":"Third International Workshop. 84\u201395","author":"Charikar M.","year":"2000","unstructured":"M. Charikar . 2000 . Greedy approximation algorithms for finding dense components in a graph. In Approximation Algorithms for Combinatorial Optimization , Third International Workshop. 84\u201395 . M. Charikar. 2000. Greedy approximation algorithms for finding dense components in a graph. In Approximation Algorithms for Combinatorial Optimization, Third International Workshop. 84\u201395."},{"key":"e_1_3_2_1_15_1","volume-title":"Trusses: Cohesive Subgraphs for Social Network Analysis.","author":"Cohen J.","year":"2008","unstructured":"J. Cohen . 2008 . Trusses: Cohesive Subgraphs for Social Network Analysis. J. Cohen. 2008. Trusses: Cohesive Subgraphs for Social Network Analysis."},{"key":"e_1_3_2_1_16_1","volume-title":"Proc. of WWW\u201917","author":"Danisch M.","unstructured":"M. Danisch , T.-H.\u00a0 H. Chan , and M. Sozio . 2017. Large Scale Density-friendly Graph Decomposition via Convex Programming . In Proc. of WWW\u201917 . 233\u2013242. M. Danisch, T.-H.\u00a0H. Chan, and M. Sozio. 2017. Large Scale Density-friendly Graph Decomposition via Convex Programming. In Proc. of WWW\u201917. 233\u2013242."},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. of WWW\u201907","author":"Dourisboure Y.","unstructured":"Y. Dourisboure , F. Geraci , and M. Pellegrini . 2007. Extraction and classification of dense communities in the web . In Proc. of WWW\u201907 . 461\u2013470. Y. Dourisboure, F. Geraci, and M. Pellegrini. 2007. Extraction and classification of dense communities in the web. In Proc. of WWW\u201907. 461\u2013470."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741638"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342645"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"key":"e_1_3_2_1_21_1","unstructured":"D. Gibson R. Kumar and A. Tomkins. 2005. Discovering Large Dense Subgraphs in Massive Graphs. In PVLDB. 721\u2013732.  D. Gibson R. Kumar and A. Tomkins. 2005. Discovering Large Dense Subgraphs in Massive Graphs. In PVLDB. 721\u2013732."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"V.\u00a0E. Lee N. Ruan R. Jin and C.\u00a0C. Aggarwal. 2010. A Survey of Algorithms for Dense Subgraph Discovery. In Managing and Mining Graph Data. 303\u2013336.  V.\u00a0E. Lee N. Ruan R. Jin and C.\u00a0C. Aggarwal. 2010. A Survey of Algorithms for Dense Subgraph Discovery. In Managing and Mining Graph Data. 303\u2013336.","DOI":"10.1007\/978-1-4419-6045-0_10"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00139635"},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. of KDD\u201915","author":"Qin L.","unstructured":"L. Qin , R.\u00a0 H. Li , L. Chang , and C. Zhang . 2015. Locally Densest Subgraph Discovery . In Proc. of KDD\u201915 . 965\u2013974. L. Qin, R.\u00a0H. Li, L. Chang, and C. Zhang. 2015. Locally Densest Subgraph Discovery. In Proc. of KDD\u201915. 965\u2013974."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741640"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1978.9989883"},{"key":"e_1_3_2_1_28_1","volume-title":"Proc. of KDD\u201910","author":"Sozio M.","unstructured":"M. Sozio and A. Gionis . 2010. The community-search problem and how to plan a successful cocktail party . In Proc. of KDD\u201910 . 939\u2013948. M. Sozio and A. Gionis. 2010. The community-search problem and how to plan a successful cocktail party. In Proc. of KDD\u201910. 939\u2013948."},{"key":"e_1_3_2_1_29_1","volume-title":"Proc. of WWW\u201915","author":"Tatti N.","unstructured":"N. Tatti and A. Gionis . 2015. Density-friendly Graph Decomposition . In Proc. of WWW\u201915 . 1089\u20131099. N. Tatti and A. Gionis. 2015. Density-friendly Graph Decomposition. In Proc. of WWW\u201915. 1089\u20131099."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31235-9_14"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"J. Wang and J. Cheng. 2012. Truss Decomposition in Massive Networks. PVLDB 5 9 (2012).  J. Wang and J. Cheng. 2012. Truss Decomposition in Massive Networks. PVLDB 5 9 (2012).","DOI":"10.14778\/2311906.2311909"}],"event":{"name":"WWW '20: The Web Conference 2020","location":"Taipei Taiwan","acronym":"WWW '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of The Web Conference 2020"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380033","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3366423.3380033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:16Z","timestamp":1750199596000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,20]]},"references-count":31,"alternative-id":["10.1145\/3366423.3380033","10.1145\/3366423"],"URL":"https:\/\/doi.org\/10.1145\/3366423.3380033","relation":{},"subject":[],"published":{"date-parts":[[2020,4,20]]},"assertion":[{"value":"2020-04-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}