{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T10:23:52Z","timestamp":1779359032500,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":64,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,4,19]],"date-time":"2021-04-19T00:00:00Z","timestamp":1618790400000},"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":[[2021,4,19]]},"DOI":"10.1145\/3442381.3450055","type":"proceedings-article","created":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T19:00:27Z","timestamp":1622746827000},"page":"379-390","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks"],"prefix":"10.1145","author":[{"given":"Ahmet Erdem","family":"Sar\u0131y\u00fcce","sequence":"first","affiliation":[{"name":"University at Buffalo, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,3]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Center for Computational Research","unstructured":"2021. Center for Computational Research , University at Buffalo . http:\/\/hdl.handle.net\/10477\/79221. 2021. Center for Computational Research, University at Buffalo. http:\/\/hdl.handle.net\/10477\/79221."},{"key":"e_1_3_2_1_2_1","volume-title":"Graphlet Decomposition: Framework, Algorithms, and Applications. KAIS","author":"Ahmed K.","year":"2016","unstructured":"N.\u00a0 K. Ahmed , J. Neville , R.\u00a0 A. Rossi , N. Duffield , and T.\u00a0 L. Willke . 2016 . Graphlet Decomposition: Framework, Algorithms, and Applications. KAIS (2016), 1\u201332. N.\u00a0K. Ahmed, J. Neville, R.\u00a0A. Rossi, N. Duffield, and T.\u00a0L. Willke. 2016. Graphlet Decomposition: Framework, Algorithms, and Applications. KAIS (2016), 1\u201332."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnx001"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23780-5_13"},{"key":"e_1_3_2_1_5_1","unstructured":"J.\u00a0Ignacio Alvarez-Hamelin Alain Barrat and Alessandro Vespignani. 2006. Large scale networks fingerprinting and visualization using the k-core decomposition. In NIPS. 41\u201350.  J.\u00a0Ignacio Alvarez-Hamelin Alain Barrat and Alessandro Vespignani. 2006. Large scale networks fingerprinting and visualization using the k-core decomposition. In NIPS. 41\u201350."},{"key":"e_1_3_2_1_6_1","unstructured":"Solon Barocas Moritz Hardt and Arvind Narayanan. 2017. Fairness in machine learning. NIPS Tutorial 1(2017).  Solon Barocas Moritz Hardt and Arvind Narayanan. 2017. Fairness in machine learning. NIPS Tutorial 1(2017)."},{"key":"e_1_3_2_1_7_1","unstructured":"V. Batagelj and M. Zaversnik. 2003. An O(m) Algorithm for Cores Decomposition of Networks. Technical Report cs\/0310049. Arxiv.  V. Batagelj and M. Zaversnik. 2003. An O(m) Algorithm for Cores Decomposition of Networks. Technical Report cs\/0310049. Arxiv."},{"key":"e_1_3_2_1_8_1","volume-title":"Higher-order organization of complex networks. Science 353, 6295","author":"Benson R.","year":"2016","unstructured":"Austin\u00a0 R. Benson , David\u00a0 F. Gleich , and Jure Leskovec . 2016. Higher-order organization of complex networks. Science 353, 6295 ( 2016 ), 163\u2013166. Austin\u00a0R. Benson, David\u00a0F. Gleich, and Jure Leskovec. 2016. Higher-order organization of complex networks. Science 353, 6295 (2016), 163\u2013166."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0701175104"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403045"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"X. Du R. Jin L. Ding V.\u00a0E. Lee and J.\u00a0H.\u00a0Thornton Jr.2009. Migration motif: a spatial - temporal pattern mining approach for financial markets.. In KDD. 1135\u20131144.  X. Du R. Jin L. Ding V.\u00a0E. Lee and J.\u00a0H.\u00a0Thornton Jr.2009. Migration motif: a spatial - temporal pattern mining approach for financial markets.. In KDD. 1135\u20131144.","DOI":"10.1145\/1557019.1557142"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"David Easley and Jon Kleinberg. 2010. Networks crowds and markets. (2010).  David Easley and Jon Kleinberg. 2010. Networks crowds and markets. (2010).","DOI":"10.1017\/CBO9780511761942"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342645"},{"key":"e_1_3_2_1_17_1","unstructured":"E. Fratkin B.\u00a0T. Naughton D.\u00a0L. Brutlag and S. Batzoglou. 2006. MotifCut: regulatory motifs finding with maximum density subgraphs.. In ISMB (2006-08-28). 156\u2013157.  E. Fratkin B.\u00a0T. Naughton D.\u00a0L. Brutlag and S. Batzoglou. 2006. MotifCut: regulatory motifs finding with maximum density subgraphs.. In ISMB (2006-08-28). 156\u2013157."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536342"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"David\u00a0F. Gleich and C. Seshadhri. 2012. Vertex Neighborhoods Low Conductance Cuts and Good Seeds for Local Community Methods. In KDD. 597\u2013605.  David\u00a0F. Gleich and C. Seshadhri. 2012. Vertex Neighborhoods Low Conductance Cuts and Good Seeds for Local Community Methods. In KDD. 597\u2013605.","DOI":"10.1145\/2339530.2339628"},{"key":"e_1_3_2_1_21_1","unstructured":"Ramanthan Guha Ravi Kumar Prabhakar Raghavan and Andrew Tomkins. 2004. Propagation of trust and distrust. In WWW. 403\u2013412.  Ramanthan Guha Ravi Kumar Prabhakar Raghavan and Andrew Tomkins. 2004. Propagation of trust and distrust. In WWW. 403\u2013412."},{"key":"e_1_3_2_1_22_1","volume-title":"Aravind Sankar, Yixiang Fang, and Brian\u00a0YH Lam.","author":"Hu Jiafeng","year":"2019","unstructured":"Jiafeng Hu , Reynold Cheng , Kevin Chen-Chuan Chang , Aravind Sankar, Yixiang Fang, and Brian\u00a0YH Lam. 2019 . Discovering maximal motif cliques in large heterogeneous information networks. In 2019 IEEE (ICDE). IEEE , 746\u2013757. Jiafeng Hu, Reynold Cheng, Kevin Chen-Chuan Chang, Aravind Sankar, Yixiang Fang, and Brian\u00a0YH Lam. 2019. Discovering maximal motif cliques in large heterogeneous information networks. In 2019 IEEE (ICDE). IEEE, 746\u2013757."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Xin Huang Hong Cheng Lu Qin Wentao Tian and Jeffrey\u00a0Xu Yu. 2014. Querying K-truss Community in Large and Dynamic Graphs. In SIGMOD. 1311\u20131322.  Xin Huang Hong Cheng Lu Qin Wentao Tian and Jeffrey\u00a0Xu Yu. 2014. Querying K-truss Community in Large and Dynamic Graphs. In SIGMOD. 1311\u20131322.","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Shweta Jain and C. Seshadhri. 2017. A Fast and Provable Method for Estimating Clique Counts Using Tur\u00e1n\u2019s Theorem. In WWW. 441\u2013449.  Shweta Jain and C. Seshadhri. 2017. A Fast and Provable Method for Estimating Clique Counts Using Tur\u00e1n\u2019s Theorem. In WWW. 441\u2013449.","DOI":"10.1145\/3038912.3052636"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Zeinab\u00a0S. Jalali Weixiang Wang Myunghwan Kim Hema Raghavan and Sucheta Soundarajan. 2020. On the Information Unfairness of Social Networks. 613\u2013521.  Zeinab\u00a0S. Jalali Weixiang Wang Myunghwan Kim Hema Raghavan and Sucheta Soundarajan. 2020. On the Information Unfairness of Social Networks. 613\u2013521.","DOI":"10.1137\/1.9781611976236.69"},{"key":"e_1_3_2_1_26_1","volume-title":"SIGMOD Conf.813\u2013826","author":"Jin R.","unstructured":"R. Jin , Y. Xiang , N. Ruan , and D. Fuhry . 2009. 3-HOP: a high-compression indexing scheme for reachability query . In SIGMOD Conf.813\u2013826 . R. Jin, Y. Xiang, N. Ruan, and D. Fuhry. 2009. 3-HOP: a high-compression indexing scheme for reachability query. In SIGMOD Conf.813\u2013826."},{"key":"e_1_3_2_1_27_1","volume-title":"The ethical algorithm: The science of socially aware algorithm design","author":"Kearns Michael","unstructured":"Michael Kearns and Aaron Roth . 2019. The ethical algorithm: The science of socially aware algorithm design . Oxford University Press . Michael Kearns and Aaron Roth. 2019. The ethical algorithm: The science of socially aware algorithm design. Oxford University Press."},{"key":"e_1_3_2_1_28_1","unstructured":"George\u00a0R Kiss Christine Armstrong Robert Milroy and James Piper. 1973. An associative thesaurus of English and its computer analysis. The computer and literary studies(1973) 153\u2013165.  George\u00a0R Kiss Christine Armstrong Robert Milroy and James Piper. 1973. An associative thesaurus of English and its computer analysis. The computer and literary studies(1973) 153\u2013165."},{"key":"e_1_3_2_1_29_1","volume-title":"Identification of influential spreaders in complex networks. Nature physics 6, 11","author":"Kitsak Maksim","year":"2010","unstructured":"Maksim Kitsak , Lazaros\u00a0 K Gallos , Shlomo Havlin , Fredrik Liljeros , Lev Muchnik , H\u00a0Eugene Stanley , and Hern\u00e1n\u00a0 A Makse . 2010. Identification of influential spreaders in complex networks. Nature physics 6, 11 ( 2010 ), 888. Maksim Kitsak, Lazaros\u00a0K Gallos, Shlomo Havlin, Fredrik Liljeros, Lev Muchnik, H\u00a0Eugene Stanley, and Hern\u00e1n\u00a0A Makse. 2010. Identification of influential spreaders in complex networks. Nature physics 6, 11 (2010), 888."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"R. Kumar P. Raghavan S. Rajagopalan and A. Tomkins. 1999. Trawling the Web for Emerging Cyber-communities. In WWW. 1481\u20131493.  R. Kumar P. Raghavan S. Rajagopalan and A. Tomkins. 1999. Trawling the Web for Emerging Cyber-communities. In WWW. 1481\u20131493.","DOI":"10.1016\/S1389-1286(99)00040-7"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Srijan Kumar William\u00a0L Hamilton Jure Leskovec and Dan Jurafsky. 2018. Community interaction and conflict on the web. In WWW. 933\u2013943.  Srijan Kumar William\u00a0L Hamilton Jure Leskovec and Dan Jurafsky. 2018. Community interaction and conflict on the web. In WWW. 933\u2013943.","DOI":"10.1145\/3178876.3186141"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"J\u00e9r\u00f4me Kunegis Andreas Lommatzsch and Christian Bauckhage. 2009. The slashdot zoo: mining a social network with negative edges. In WWW. ACM 741\u2013750.  J\u00e9r\u00f4me Kunegis Andreas Lommatzsch and Christian Bauckhage. 2009. The slashdot zoo: mining a social network with negative edges. In WWW. ACM 741\u2013750.","DOI":"10.1145\/1526709.1526809"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"V.\u00a0E. Lee N. Ruan R. Jin and C. Aggarwal. 2010. A Survey of Algorithms for Dense Subgraph Discovery.In Managing and Mining Graph Data. Vol.\u00a040.  V.\u00a0E. Lee N. Ruan R. Jin and C. Aggarwal. 2010. A Survey of Algorithms for Dense Subgraph Discovery.In Managing and Mining Graph Data. Vol.\u00a040.","DOI":"10.1007\/978-1-4419-6045-0_10"},{"key":"e_1_3_2_1_34_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets."},{"key":"e_1_3_2_1_35_1","unstructured":"Jure Leskovec Kevin\u00a0J. Lang Anirban Dasgupta and Michael\u00a0W. Mahoney. 2008. Statistical Properties of Community Structure in Large Social and Information Networks(WWW \u201908). ACM 695\u2013704.  Jure Leskovec Kevin\u00a0J. Lang Anirban Dasgupta and Michael\u00a0W. Mahoney. 2008. Statistical Properties of Community Structure in Large Social and Information Networks(WWW \u201908). ACM 695\u2013704."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Pei Li Ling Huang Chang-Dong Wang and Jian-Huang Lai. 2019. EdMot: An Edge Enhancement Approach for Motif-aware Community Detection. In SIGKDD. 479\u2013487.  Pei Li Ling Huang Chang-Dong Wang and Jian-Huang Lai. 2019. EdMot: An Edge Enhancement Approach for Motif-aware Community Detection. In SIGKDD. 479\u2013487.","DOI":"10.1145\/3292500.3330882"},{"key":"e_1_3_2_1_37_1","volume-title":"Locating influential nodes in complex networks. Scientific reports 6(2016)","author":"Malliaros D","year":"1930","unstructured":"Fragkiskos\u00a0 D Malliaros , Maria-Evgenia\u00a0 G Rossi , and Michalis Vazirgiannis . 2016. Locating influential nodes in complex networks. Scientific reports 6(2016) , 1930 7. Fragkiskos\u00a0D Malliaros, Maria-Evgenia\u00a0G Rossi, and Michalis Vazirgiannis. 2016. Locating influential nodes in complex networks. Scientific reports 6(2016), 19307."},{"key":"e_1_3_2_1_38_1","volume-title":"Introduction to information retrieval","author":"Manning D","unstructured":"Christopher\u00a0 D Manning , Hinrich Sch\u00fctze , and Prabhakar Raghavan . 2008. Introduction to information retrieval . Cambridge university press . Christopher\u00a0D Manning, Hinrich Sch\u00fctze, and Prabhakar Raghavan. 2008. Introduction to information retrieval. Cambridge university press."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx758"},{"key":"e_1_3_2_1_40_1","volume-title":"Network motifs: simple building blocks of complex networks. Science 298, 5594","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 298, 5594 ( 2002 ), 824\u2013827. Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii, and Uri Alon. 2002. Network motifs: simple building blocks of complex networks. Science 298, 5594 (2002), 824\u2013827."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.66.035101"},{"key":"e_1_3_2_1_42_1","unstructured":"Chengbin Peng Tamara\u00a0G Kolda and Ali Pinar. 2014. Accelerating community detection by using k-core subgraphs. arXiv preprint arXiv:1403.2226(2014).  Chengbin Peng Tamara\u00a0G Kolda and Ali Pinar. 2014. Accelerating community detection by using k-core subgraphs. arXiv preprint arXiv:1403.2226(2014)."},{"key":"e_1_3_2_1_43_1","volume-title":"ESCAPE: Efficiently Counting All 5-Vertex Subgraphs(WWW \u201917). 1431\u20131440.","author":"Pinar Ali","year":"2017","unstructured":"Ali Pinar , C. Seshadhri , and Vaidyanathan Vishal . 2017 . ESCAPE: Efficiently Counting All 5-Vertex Subgraphs(WWW \u201917). 1431\u20131440. Ali Pinar, C. Seshadhri, and Vaidyanathan Vishal. 2017. ESCAPE: Efficiently Counting All 5-Vertex Subgraphs(WWW \u201917). 1431\u20131440."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl301"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0706851105"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"K. Saito and T. Yamada. 2006. Extracting Communities from Complex Networks by the k-dense Method. In ICDMW.  K. Saito and T. Yamada. 2006. Extracting Communities from Complex Networks by the k-dense Method. In ICDMW.","DOI":"10.1109\/ICDMW.2006.76"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Anida Sarajli\u0107 No\u00ebl Malod-Dognin \u00d6mer\u00a0Nebil Yavero\u011flu and Nata\u0161a Pr\u017eulj. 2016. Graphlet-based characterization of directed networks. Scientific reports 6(2016) 35098.  Anida Sarajli\u0107 No\u00ebl Malod-Dognin \u00d6mer\u00a0Nebil Yavero\u011flu and Nata\u0161a Pr\u017eulj. 2016. Graphlet-based characterization of directed networks. Scientific reports 6(2016) 35098.","DOI":"10.1038\/srep35098"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021927"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"crossref","unstructured":"A.\u00a0Erdem Sariy\u00fcce and Ali Pinar. 2018. Peeling Bipartite Networks for Dense Subgraph Discovery. In WSDM.  A.\u00a0Erdem Sariy\u00fcce and Ali Pinar. 2018. Peeling Bipartite Networks for Dense Subgraph Discovery. In WSDM.","DOI":"10.1145\/3159652.3159678"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"crossref","unstructured":"A.\u00a0Erdem Sar\u0131y\u00fcce C. Seshadhri A. P\u0131nar and \u00dc.\u00a0V. \u00c7ataly\u00fcrek. 2015. Finding the Hierarchy of Dense Subgraphs Using Nucleus Decompositions. In WWW (Florence Italy). 927\u2013937.  A.\u00a0Erdem Sar\u0131y\u00fcce C. Seshadhri A. P\u0131nar and \u00dc.\u00a0V. \u00c7ataly\u00fcrek. 2015. Finding the Hierarchy of Dense Subgraphs Using Nucleus Decompositions. In WWW (Florence Italy). 927\u2013937.","DOI":"10.1145\/2736277.2741640"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3057742"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_3_2_1_53_1","first-page":"32","article-title":"Directed closure measures for networks with reciprocity","volume":"5","author":"Seshadhri C","year":"2016","unstructured":"C Seshadhri , Ali Pinar , Nurcan Durak , and Tamara\u00a0 G Kolda . 2016 . Directed closure measures for networks with reciprocity . Journal of Complex Networks 5 , 1 (2016), 32 \u2013 47 . C Seshadhri, Ali Pinar, Nurcan Durak, and Tamara\u00a0G Kolda. 2016. Directed closure measures for networks with reciprocity. Journal of Complex Networks 5, 1 (2016), 32\u201347.","journal-title":"Journal of Complex Networks"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11224"},{"key":"e_1_3_2_1_55_1","volume-title":"Fairness in Social Influence Maximization. In Companion Proceedings of The 2019 Web Conference. 569\u2013574","author":"Stoica Ana-Andreea","year":"2019","unstructured":"Ana-Andreea Stoica and Augustin Chaintreau . 2019 . Fairness in Social Influence Maximization. In Companion Proceedings of The 2019 Web Conference. 569\u2013574 . Ana-Andreea Stoica and Augustin Chaintreau. 2019. Fairness in Social Influence Maximization. In Companion Proceedings of The 2019 Web Conference. 569\u2013574."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.5555\/2371211"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402736"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsos.160270"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"crossref","unstructured":"Amanda\u00a0L Traud Peter\u00a0J Mucha and Mason\u00a0A Porter. 2012. Social structure of facebook networks. Physica A: Statistical Mechanics and its Applications 391 16(2012) 4165\u20134180.  Amanda\u00a0L Traud Peter\u00a0J Mucha and Mason\u00a0A Porter. 2012. Social structure of facebook networks. Physica A: Statistical Mechanics and its Applications 391 16(2012) 4165\u20134180.","DOI":"10.1016\/j.physa.2011.12.021"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"crossref","unstructured":"C. Tsourakakis. 2015. The K-clique Densest Subgraph Problem(WWW \u201915). 1122\u20131132.  C. Tsourakakis. 2015. The K-clique Densest Subgraph Problem(WWW \u201915). 1122\u20131132.","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"crossref","unstructured":"C.\u00a0E. Tsourakakis J. Pachocki and M. Mitzenmacher. 2017. Scalable Motif-aware Graph Clustering(WWW \u201917). 1451\u20131460.  C.\u00a0E. Tsourakakis J. Pachocki and M. Mitzenmacher. 2017. Scalable Motif-aware Graph Clustering(WWW \u201917). 1451\u20131460.","DOI":"10.1145\/3038912.3052653"},{"key":"e_1_3_2_1_62_1","unstructured":"Robert\u00a0E Ulanowicz Cristina Bondavalli and MS Egnotovich. 1998. Network analysis of trophic dynamics in south florida ecosystem fy 97: The florida bay ecosystem. Annual Report to the United States Geological Service Biological Resources Division Ref. No.[UMCES] CBL(1998) 98\u2013123.  Robert\u00a0E Ulanowicz Cristina Bondavalli and MS Egnotovich. 1998. Network analysis of trophic dynamics in south florida ecosystem fy 97: The florida bay ecosystem. Annual Report to the United States Geological Service Biological Resources Division Ref. No.[UMCES] CBL(1998) 98\u2013123."},{"key":"e_1_3_2_1_63_1","volume-title":"A tutorial on spectral clustering. Statistics and computing 17, 4","author":"Von\u00a0Luxburg Ulrike","year":"2007","unstructured":"Ulrike Von\u00a0Luxburg . 2007. A tutorial on spectral clustering. Statistics and computing 17, 4 ( 2007 ), 395\u2013416. Ulrike Von\u00a0Luxburg. 2007. A tutorial on spectral clustering. Statistics and computing 17, 4 (2007), 395\u2013416."},{"key":"e_1_3_2_1_64_1","volume-title":"Efficient entity resolution based on subgraph cohesion. Knowledge and information systems 46, 2","author":"Wang Hongzhi","year":"2016","unstructured":"Hongzhi Wang , Jianzhong Li , and Hong Gao . 2016. Efficient entity resolution based on subgraph cohesion. Knowledge and information systems 46, 2 ( 2016 ), 285\u2013314. Hongzhi Wang, Jianzhong Li, and Hong Gao. 2016. Efficient entity resolution based on subgraph cohesion. Knowledge and information systems 46, 2 (2016), 285\u2013314."},{"key":"e_1_3_2_1_65_1","volume-title":"Article 43 (Aug.","author":"Xie Jierui","year":"2013","unstructured":"Jierui Xie , Stephen Kelley , and Boleslaw\u00a0 K. Szymanski . 2013. Overlapping Community Detection in Networks: The State-of-the-art and Comparative Study. ACM Comput. Surv. 45, 4 , Article 43 (Aug. 2013 ), 35\u00a0pages. Jierui Xie, Stephen Kelley, and Boleslaw\u00a0K. Szymanski. 2013. Overlapping Community Detection in Networks: The State-of-the-art and Comparative Study. ACM Comput. Surv. 45, 4, Article 43 (Aug. 2013), 35\u00a0pages."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"crossref","unstructured":"\u00d6mer\u00a0Nebil Yavero\u011flu No\u00ebl Malod-Dognin Darren Davis Zoran Levnajic Vuk Janjic Rasa Karapandza Aleksandar Stojmirovic and Nata\u0161a Pr\u017eulj. 2014. Revealing the hidden language of complex networks. Scientific reports 4(2014) 4547.  \u00d6mer\u00a0Nebil Yavero\u011flu No\u00ebl Malod-Dognin Darren Davis Zoran Levnajic Vuk Janjic Rasa Karapandza Aleksandar Stojmirovic and Nata\u0161a Pr\u017eulj. 2014. Revealing the hidden language of complex networks. Scientific reports 4(2014) 4547.","DOI":"10.1038\/srep04547"}],"event":{"name":"WWW '21: The Web Conference 2021","location":"Ljubljana Slovenia","acronym":"WWW '21","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the Web Conference 2021"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3450055","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3442381.3450055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:45Z","timestamp":1750195485000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3450055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,19]]},"references-count":64,"alternative-id":["10.1145\/3442381.3450055","10.1145\/3442381"],"URL":"https:\/\/doi.org\/10.1145\/3442381.3450055","relation":{},"subject":[],"published":{"date-parts":[[2021,4,19]]},"assertion":[{"value":"2021-06-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}