{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:08:32Z","timestamp":1775912912643,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,5,31]],"date-time":"2020-05-31T00:00:00Z","timestamp":1590883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006066","name":"University of Hong Kong","doi-asserted-by":"publisher","award":["104004572,102009508,104004129),"],"award-info":[{"award-number":["104004572,102009508,104004129),"]}],"id":[{"id":"10.13039\/501100006066","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee","doi-asserted-by":"publisher","award":["HKU17229116,HKU106150091,HKU17205115"],"award-info":[{"award-number":["HKU17229116,HKU106150091,HKU17205115"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012659","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61232006"],"award-info":[{"award-number":["61232006"]}],"id":[{"id":"10.13039\/501100012659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007156","name":"Innovation and Technology Commission - Hong Kong","doi-asserted-by":"publisher","award":["MRP\/029\/18"],"award-info":[{"award-number":["MRP\/029\/18"]}],"id":[{"id":"10.13039\/501100007156","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,11]]},"DOI":"10.1145\/3318464.3389697","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T17:12:33Z","timestamp":1590772353000},"page":"1051-1066","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":60,"title":["Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs"],"prefix":"10.1145","author":[{"given":"Chenhao","family":"Ma","sequence":"first","affiliation":[{"name":"The University of Hong Kong, Hong Kong, China"}]},{"given":"Yixiang","family":"Fang","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, NSW, Australia"}]},{"given":"Reynold","family":"Cheng","sequence":"additional","affiliation":[{"name":"The University of Hong Kong, Hong Kong, China"}]},{"given":"Laks V.S.","family":"Lakshmanan","sequence":"additional","affiliation":[{"name":"The University of British Columbia, Vancouver, BC, Canada"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, NSW, Australia"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, NSW, Australia"}]}],"member":"320","published-online":{"date-parts":[[2020,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Federal Aviation Administration. 2019. Air Traffic Control System Command Center. https:\/\/www.faa.gov. (2019).  Federal Aviation Administration. 2019. Air Traffic Control System Command Center. https:\/\/www.faa.gov. (2019)."},{"key":"e_1_3_2_2_2_1","volume-title":"Internet: Diameter of the world-wide web. nature","author":"Albert R\u00e9ka","year":"1999","unstructured":"R\u00e9ka Albert , Hawoong Jeong , and Albert-L\u00e1szl\u00f3 Barab\u00e1si . 1999 . Internet: Diameter of the world-wide web. nature , Vol. 401 , 6749 (1999), 130. R\u00e9ka Albert, Hawoong Jeong, and Albert-L\u00e1szl\u00f3 Barab\u00e1si. 1999. Internet: Diameter of the world-wide web. nature, Vol. 401, 6749 (1999), 130."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"e_1_3_2_2_4_1","volume-title":"arXiv preprint cs\/0310049","author":"Batagelj Vladimir","year":"2003","unstructured":"Vladimir Batagelj and Matjaz Zaversnik . 2003. An O(m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 ( 2003 ). Vladimir Batagelj and Matjaz Zaversnik. 2003. An O(m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806719"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341547"},{"key":"e_1_3_2_2_7_1","volume-title":"Francesca Colaiori, Luciana S Buriol, Debora Donato, Stefano Leonardi, and Guido Caldarelli.","author":"Capocci Andrea","year":"2006","unstructured":"Andrea Capocci , Vito DP Servedio , Francesca Colaiori, Luciana S Buriol, Debora Donato, Stefano Leonardi, and Guido Caldarelli. 2006 . Preferential attachment in the growth of social networks: The internet encyclopedia Wikipedia. Physical review E, Vol. 74 , 3 (2006), 036116. Andrea Capocci, Vito DP Servedio, Francesca Colaiori, Luciana S Buriol, Debora Donato, Stefano Leonardi, and Guido Caldarelli. 2006. Preferential attachment in the growth of social networks: The internet encyclopedia Wikipedia. Physical review E, Vol. 74, 3 (2006), 036116."},{"key":"e_1_3_2_2_8_1","volume-title":"Proc. Int. Conf. on Weblogs and Social Media. 10--17","author":"Cha Meeyoung","year":"2010","unstructured":"Meeyoung Cha , Hamed Haddadi , Fabricio Benevenuto , and Krishna P. Gummadi . 2010 . Measuring User Influence in Twitter: The Million Follower Fallacy . In Proc. Int. Conf. on Weblogs and Social Media. 10--17 . Meeyoung Cha, Hamed Haddadi, Fabricio Benevenuto, and KrishnaP. Gummadi. 2010. Measuring User Influence in Twitter: The Million Follower Fallacy. In Proc. Int. Conf. on Weblogs and Social Media. 10--17."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44436-X_10"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052619"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Soroush Ebadian and Xin Huang. 2019. Fast Algorithm for K-Truss Discovery on Public-Private Graphs. (2019) 2258--2264.  Soroush Ebadian and Xin Huang. 2019. Fast Algorithm for K-Truss Discovery on Public-Private Graphs. (2019) 2258--2264.","DOI":"10.24963\/ijcai.2019\/313"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0482-5"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055337"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994538"},{"key":"e_1_3_2_2_15_1","volume-title":"2019 a. A survey of community search over big graphs. The VLDB Journal","author":"Fang Yixiang","year":"2019","unstructured":"Yixiang Fang , Xin Huang , Lu Qin , Ying Zhang , Wenjie Zhang , Reynold Cheng , and Xuemin Lin . 2019 a. A survey of community search over big graphs. The VLDB Journal ( 2019 ), 1--40. Yixiang Fang, Xin Huang, Lu Qin, Ying Zhang, Wenjie Zhang, Reynold Cheng, and Xuemin Lin. 2019 a. A survey of community search over big graphs. The VLDB Journal (2019), 1--40."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2845414"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2872982"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380756"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342645"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(97)00016-6"},{"key":"e_1_3_2_2_21_1","volume-title":"D-cores: measuring collaboration of directed graphs based on degeneracy. Knowledge and information systems","author":"Giatsidis Christos","year":"2013","unstructured":"Christos Giatsidis , Dimitrios M Thilikos , and Michalis Vazirgiannis . 2013. D-cores: measuring collaboration of directed graphs based on degeneracy. Knowledge and information systems , Vol. 35 , 2 ( 2013 ), 311--343. Christos Giatsidis, Dimitrios M Thilikos, and Michalis Vazirgiannis. 2013. D-cores: measuring collaboration of directed graphs based on degeneracy. Knowledge and information systems, Vol. 35, 2 (2013), 311--343."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2789987"},{"key":"e_1_3_2_2_23_1","volume-title":"Finding a maximum density subgraph","author":"Goldberg Andrew V","unstructured":"Andrew V Goldberg . 1984. Finding a maximum density subgraph . University of California Berkeley , CA. Andrew V Goldberg. 1984. Finding a maximum density subgraph .University of California Berkeley, CA."},{"key":"e_1_3_2_2_24_1","unstructured":"GT Heineman G Pollice and S Selkow. 2008. Network Flow Algorithms. Algorithms in a Nutshell. (2008).  GT Heineman G Pollice and S Selkow. 2008. Network Flow Algorithms. Algorithms in a Nutshell. (2008)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939747"},{"key":"e_1_3_2_2_26_1","volume-title":"Discovering Maximal Motif Cliques in Large Heterogeneous Information Networks. In International Conference on Data Engineering (ICDE). IEEE, 746--757","author":"Hu Jiafeng","year":"2019","unstructured":"Jiafeng Hu , Reynold Cheng , Kevin Chen-Chuan Chang , Aravind Sankar , Yixiang Fang , and Brian YH Lam . 2019 . Discovering Maximal Motif Cliques in Large Heterogeneous Information Networks. In International Conference on Data Engineering (ICDE). IEEE, 746--757 . Jiafeng Hu, Reynold Cheng, Kevin Chen-Chuan Chang, Aravind Sankar, Yixiang Fang, and BrianYH Lam. 2019. Discovering Maximal Motif Cliques in Large Heterogeneous Information Networks. In International Conference on Data Engineering (ICDE). IEEE, 746--757."},{"key":"e_1_3_2_2_27_1","volume-title":"Laks VS Lakshmanan, and Jianliang Xu","author":"Huang Xin","year":"2019","unstructured":"Xin Huang , Laks VS Lakshmanan, and Jianliang Xu . 2019 . Community Search over Big Graphs .Morgan & Claypool Publishers . Xin Huang, Laks VS Lakshmanan, and Jianliang Xu. 2019. Community Search over Big Graphs .Morgan & Claypool Publishers."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856323"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1348549.1348556"},{"key":"e_1_3_2_2_30_1","unstructured":"Ravi Kannan and V Vinay. 1999. Analyzing the structure of large graphs .Rheinische Friedrich-Wilhelms-Universitat Bonn Bonn.  Ravi Kannan and V Vinay. 1999. Analyzing the structure of large graphs .Rheinische Friedrich-Wilhelms-Universitat Bonn Bonn."},{"key":"e_1_3_2_2_31_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Khuller Samir","unstructured":"Samir Khuller and Barna Saha . 2009. On finding dense subgraphs . In International Colloquium on Automata, Languages, and Programming . Springer , 597--608. Samir Khuller and Barna Saha. 2009. On finding dense subgraphs. In International Colloquium on Automata, Languages, and Programming. Springer, 597--608."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_3_2_2_33_1","volume-title":"Proc. Int. Conf. on World Wide Web Companion. 1343--1350","author":"Kunegis J\u00e9r\u00f4me","year":"2013","unstructured":"J\u00e9r\u00f4me Kunegis . 2013 . KONECT -- The Koblenz Network Collection . In Proc. Int. Conf. on World Wide Web Companion. 1343--1350 . http:\/\/userpages.uni-koblenz.de\/kunegis\/paper\/kunegis-koblenz-network-collection.pdf J\u00e9r\u00f4me Kunegis. 2013. KONECT -- The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion. 1343--1350. http:\/\/userpages.uni-koblenz.de\/kunegis\/paper\/kunegis-koblenz-network-collection.pdf"},{"key":"e_1_3_2_2_34_1","article-title":"The Dynamics of Viral Marketing","volume":"1","author":"Leskovec Jure","year":"2007","unstructured":"Jure Leskovec , Lada A. Adamic , and Bernardo A. Huberman . 2007 . The Dynamics of Viral Marketing . ACM Transaction on the Web , Vol. 1 , 1 (2007). Jure Leskovec, Lada A. Adamic, and Bernardo A. Huberman. 2007. The Dynamics of Viral Marketing. ACM Transaction on the Web, Vol. 1, 1 (2007).","journal-title":"ACM Transaction on the Web"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Qing Liu Minjun Zhao Xin Huang Jianliang Xu and Yunjun Gao. 2020. Truss-based Community Search over Large Directed Graphs. In SIGMOD .  Qing Liu Minjun Zhao Xin Huang Jianliang Xu and Yunjun Gao. 2020. Truss-based Community Search over Large Directed Graphs. In SIGMOD .","DOI":"10.1145\/3318464.3380587"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364330"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/DASC.2009.130"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783385"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Arjun Mukherjee Bing Liu and Natalie Glance. 2012. Spotting Fake Reviewer Groups in Consumer Reviews. In WWW. 191--200.  Arjun Mukherjee Bing Liu and Natalie Glance. 2012. Spotting Fake Reviewer Groups in Consumer Reviews. In WWW. 191--200.","DOI":"10.1145\/2187836.2187863"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25093-4_14"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2010.03.006"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488705"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13672-6_42"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783299"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-5601(55)80012-3"},{"key":"e_1_3_2_2_46_1","volume-title":"Network structure and minimum degree. Social networks","author":"Seidman Stephen B","year":"1983","unstructured":"Stephen B Seidman . 1983. Network structure and minimum degree. Social networks , Vol. 5 , 3 ( 1983 ), 269--287. Stephen B Seidman. 1983. Network structure and minimum degree. Social networks, Vol. 5, 3 (1983), 269--287."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741119"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487645"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","unstructured":"Zhiwei Zhang Xin Huang Jianliang Xu Byron Choi and Zechao Shang. 2019. Keyword-Centric Community Search. In ICDE. 422--433.  Zhiwei Zhang Xin Huang Jianliang Xu Byron Choi and Zechao Shang. 2019. Keyword-Centric Community Search. In ICDE. 422--433.","DOI":"10.1109\/ICDE.2019.00045"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSC.2017.80"}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","location":"Portland OR USA","acronym":"SIGMOD\/PODS '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3389697","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318464.3389697","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:44Z","timestamp":1750199924000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3389697"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,31]]},"references-count":51,"alternative-id":["10.1145\/3318464.3389697","10.1145\/3318464"],"URL":"https:\/\/doi.org\/10.1145\/3318464.3389697","relation":{},"subject":[],"published":{"date-parts":[[2020,5,31]]},"assertion":[{"value":"2020-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}