{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T03:01:24Z","timestamp":1775617284182,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":59,"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.3380119","type":"proceedings-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T08:11:44Z","timestamp":1588579904000},"page":"339-349","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["Efficient Maximal Balanced Clique Enumeration in Signed Networks"],"prefix":"10.1145","author":[{"given":"Zi","family":"Chen","sequence":"first","affiliation":[{"name":"ECNU, China"}]},{"given":"Long","family":"Yuan","sequence":"additional","affiliation":[{"name":"Nanjing University of Science and Technology, China"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"UNSW, Australia"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[{"name":"UTS, Australia"}]},{"given":"Jianye","family":"Yang","sequence":"additional","affiliation":[{"name":"Hunan University, China"}]}],"member":"320","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1080\/00222500902718239"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202001"},{"key":"e_1_3_2_1_3_1","first-page":"211","article-title":"A landscape theory of aggregation","volume":"23","author":"Axelrod R.","year":"1993","unstructured":"R. Axelrod and D.\u00a0 S. Bennett . 1993 . A landscape theory of aggregation . BJPS 23 , 02 (1993), 211 \u2013 233 . R. Axelrod and D.\u00a0S. Bennett. 1993. A landscape theory of aggregation. BJPS 23, 02 (1993), 211\u2013233.","journal-title":"BJPS"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_1_5_1","volume-title":"Structural balance: a generalization of Heider\u2019s theory.Psychological review 63, 5","author":"Cartwright Dorwin","year":"1956","unstructured":"Dorwin Cartwright and Frank Harary . 1956. Structural balance: a generalization of Heider\u2019s theory.Psychological review 63, 5 ( 1956 ), 277. Dorwin Cartwright and Frank Harary. 1956. Structural balance: a generalization of Heider\u2019s theory.Psychological review 63, 5 (1956), 277."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339724"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939855"},{"key":"e_1_3_2_1_9_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 . IEEE Transactions on Knowledge and Data Engineering ( 2008). J. Cohen. 2008. Trusses: Cohesive subgraphs for social network analysis. IEEE Transactions on Knowledge and Data Engineering (2008)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271746"},{"key":"e_1_3_2_1_11_1","volume-title":"Networks, crowds, and markets: Reasoning about a highly connected world","author":"Easley David","unstructured":"David Easley and Jon Kleinberg . 2010. Networks, crowds, and markets: Reasoning about a highly connected world . Cambridge University Press . David Easley and Jon Kleinberg. 2010. Networks, crowds, and markets: Reasoning about a highly connected world. Cambridge University Press."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20662-7_31"},{"key":"e_1_3_2_1_14_1","volume-title":"Algorithms for Finding Maximal and Maximum Cliques: A Survey. In International Conference on Intelligent Systems Design and Applications. 745\u2013754","author":"Fakhfakh Faten","year":"2017","unstructured":"Faten Fakhfakh , Mohamed Tounsi , Mohamed Mosbah , and Ahmed\u00a0Hadj Kacem . 2017 . Algorithms for Finding Maximal and Maximum Cliques: A Survey. In International Conference on Intelligent Systems Design and Applications. 745\u2013754 . Faten Fakhfakh, Mohamed Tounsi, Mohamed Mosbah, and Ahmed\u00a0Hadj Kacem. 2017. Algorithms for Finding Maximal and Maximum Cliques: A Survey. In International Conference on Intelligent Systems Design and Applications. 745\u2013754."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-018-7232-6"},{"key":"e_1_3_2_1_16_1","volume-title":"On detecting maximal quasi antagonistic communities in signed graphs. Data mining and knowledge discovery 30, 1","author":"Gao Ming","year":"2016","unstructured":"Ming Gao , Ee-Peng Lim , David Lo , and Philips\u00a0Kokoh Prasetyo . 2016. On detecting maximal quasi antagonistic communities in signed graphs. Data mining and knowledge discovery 30, 1 ( 2016 ), 99\u2013146. Ming Gao, Ee-Peng Lim, David Lo, and Philips\u00a0Kokoh Prasetyo. 2016. On detecting maximal quasi antagonistic communities in signed graphs. Data mining and knowledge discovery 30, 1 (2016), 99\u2013146."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2014.25"},{"key":"e_1_3_2_1_18_1","volume-title":"On the notion of balance of a signed graph.The Michigan Mathematical Journal 2, 2","author":"Frank Harary","year":"1953","unstructured":"Frank Harary 1953. On the notion of balance of a signed graph.The Michigan Mathematical Journal 2, 2 ( 1953 ), 143\u2013146. Frank Harary 1953. On the notion of balance of a signed graph.The Michigan Mathematical Journal 2, 2 (1953), 143\u2013146."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/00223980.1946.9917275"},{"key":"e_1_3_2_1_20_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_21_1","first-page":"39","article-title":"Importance of strategic alliances in company\u2019s activity","volume":"1","author":"I\u0161orait\u0117 Margarita","year":"2009","unstructured":"Margarita I\u0161orait\u0117 . 2009 . Importance of strategic alliances in company\u2019s activity . BJPS 1 , 5 (2009), 39 \u2013 46 . Margarita I\u0161orait\u0117. 2009. Importance of strategic alliances in company\u2019s activity. BJPS 1, 5 (2009), 39\u201346.","journal-title":"BJPS"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-018-0634-6"},{"key":"e_1_3_2_1_23_1","volume-title":"Edge Weight Prediction in Weighted Signed Networks. In IEEE 16th International Conference on Data Mining. 221\u2013230","author":"Kumar Srijan","year":"2016","unstructured":"Srijan Kumar , Francesca Spezzano , V.\u00a0 S. Subrahmanian , and Christos Faloutsos . 2016 . Edge Weight Prediction in Weighted Signed Networks. In IEEE 16th International Conference on Data Mining. 221\u2013230 . Srijan Kumar, Francesca Spezzano, V.\u00a0S. Subrahmanian, and Christos Faloutsos. 2016. Edge Weight Prediction in Weighted Signed Networks. In IEEE 16th International Conference on Data Mining. 221\u2013230."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Vishwajeet Kumar Nitish Joshi Arijit Mukherjee Ganesh Ramakrishnan and Preethi Jyothi. 2019. Cross-Lingual Training for Automatic Question Generation. In ACL. 4863\u20134872.  Vishwajeet Kumar Nitish Joshi Arijit Mukherjee Ganesh Ramakrishnan and Preethi Jyothi. 2019. Cross-Lingual Training for Automatic Question Generation. In ACL. 4863\u20134872.","DOI":"10.18653\/v1\/P19-1481"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526809"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753532"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00031"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313522"},{"key":"e_1_3_2_1_29_1","article-title":"An Easy-to-hard Learning Paradigm for Multiple Classes and Multiple Labels","volume":"18","author":"Liu Weiwei","year":"2017","unstructured":"Weiwei Liu , Ivor\u00a0 W. Tsang , and Klaus-Robert M\u00fcller . 2017 . An Easy-to-hard Learning Paradigm for Multiple Classes and Multiple Labels . J. Mach. Learn. Res. 18 (2017), 94:1\u201394:38. Weiwei Liu, Ivor\u00a0W. Tsang, and Klaus-Robert M\u00fcller. 2017. An Easy-to-hard Learning Paradigm for Multiple Classes and Multiple Labels. J. Mach. Learn. Res. 18(2017), 94:1\u201394:38.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2794976"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063722"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1013213108"},{"key":"e_1_3_2_1_33_1","volume-title":"Energy landscape of social balance. Physical review letters 103, 19","author":"Marvel A","year":"2009","unstructured":"Seth\u00a0 A Marvel , Steven\u00a0 H Strogatz , and Jon\u00a0 M Kleinberg . 2009. Energy landscape of social balance. Physical review letters 103, 19 ( 2009 ), 198701. Seth\u00a0A Marvel, Steven\u00a0H Strogatz, and Jon\u00a0M Kleinberg. 2009. Energy landscape of social balance. Physical review letters 103, 19 (2009), 198701."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/219717.219748"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2015.2401014"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377371"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91452-7_16"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.10.021"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91452-7_14"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741640"},{"key":"e_1_3_2_1_41_1","volume-title":"Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs. TWEB 11, 3","author":"Sariy\u00fcce Ahmet\u00a0Erdem","year":"2017","unstructured":"Ahmet\u00a0Erdem Sariy\u00fcce , C. Seshadhri , Ali Pinar , and \u00dcmit\u00a0 V. \u00c7ataly\u00fcrek . 2017. Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs. TWEB 11, 3 ( 2017 ), 16:1\u201316:27. Ahmet\u00a0Erdem Sariy\u00fcce, C. Seshadhri, Ali Pinar, and \u00dcmit\u00a0V. \u00c7ataly\u00fcrek. 2017. Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs. TWEB 11, 3 (2017), 16:1\u201316:27."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.01.003"},{"key":"e_1_3_2_1_43_1","volume-title":"Network structure and minimum degree. Social networks 5, 3","author":"Seidman B","year":"1983","unstructured":"Stephen\u00a0 B Seidman . 1983. Network structure and minimum degree. Social networks 5, 3 ( 1983 ), 269\u2013287. Stephen\u00a0B Seidman. 1983. Network structure and minimum degree. Social networks 5, 3 (1983), 269\u2013287."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321588"},{"key":"e_1_3_2_1_45_1","unstructured":"Yansen Su Bangju Wang Fan Cheng Xingyi Zhang and Linqiang Pan. 2017. An algorithm based on positive and negative links for community detection in signed networks. In Nature Scientific Reports.  Yansen Su Bangju Wang Fan Cheng Xingyi Zhang and Linqiang Pan. 2017. An algorithm based on positive and negative links for community detection in signed networks. In Nature Scientific Reports."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2956185"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"e_1_3_2_1_48_1","first-page":"75","article-title":"I\/O Efficient Core Graph Decomposition: Application to Degeneracy Ordering","volume":"31","author":"Wen D.","year":"2019","unstructured":"D. Wen , L. Qin , Y. Zhang , X. Lin , and J.\u00a0 X. Yu . 2019 . I\/O Efficient Core Graph Decomposition: Application to Degeneracy Ordering . IEEE TKDE 31 , 1 (2019), 75 \u2013 90 . D. Wen, L. Qin, Y. Zhang, X. Lin, and J.\u00a0X. Yu. 2019. I\/O Efficient Core Graph Decomposition: Application to Degeneracy Ordering. IEEE TKDE 31, 1 (2019), 75\u201390.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-18576-3_36"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.23"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0408-z"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904484"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.14778\/3157794.3157802"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0451-4"},{"key":"e_1_3_2_1_55_1","first-page":"922","article-title":"Index-Based Densest Clique Percolation Community Search in Networks","volume":"30","author":"Yuan Long","year":"2018","unstructured":"Long Yuan , Lu Qin , Wenjie Zhang , Lijun Chang , and Jianye Yang . 2018 . Index-Based Densest Clique Percolation Community Search in Networks . IEEE TKDE 30 , 5 (2018), 922 \u2013 935 . Long Yuan, Lu Qin, Wenjie Zhang, Lijun Chang, and Jianye Yang. 2018. Index-Based Densest Clique Percolation Community Search in Networks. IEEE TKDE 30, 5 (2018), 922\u2013935.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_1_56_1","volume-title":"Proceedings of IES, Vol.\u00a01.","author":"Zeng Yujie","unstructured":"Yujie Zeng and Jing Liu . [n.d.]. Community detection from signed social networks using a multi-objective evolutionary algorithm . In Proceedings of IES, Vol.\u00a01. Yujie Zeng and Jing Liu. [n.d.]. Community detection from signed social networks using a multi-objective evolutionary algorithm. In Proceedings of IES, Vol.\u00a01."},{"key":"e_1_3_2_1_57_1","volume-title":"On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC bioinformatics 15, 1","author":"Zhang Yun","year":"2014","unstructured":"Yun Zhang , Charles\u00a0 A Phillips , Gary\u00a0 L Rogers , Erich\u00a0 J Baker , Elissa\u00a0 J Chesler , and Michael\u00a0 A Langston . 2014. On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC bioinformatics 15, 1 ( 2014 ), 110. Yun Zhang, Charles\u00a0A Phillips, Gary\u00a0L Rogers, Erich\u00a0J Baker, Elissa\u00a0J Chesler, and Michael\u00a0A Langston. 2014. On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC bioinformatics 15, 1 (2014), 110."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10796-014-9483-8"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"crossref","unstructured":"R. Zhou C. Liu J.\u00a0X. Yu W. Liang B. Chen and J. Li. 2012. Finding maximal k-edge-connected subgraphs from a large graph. in EDBT (2012).  R. Zhou C. Liu J.\u00a0X. Yu W. Liang B. Chen and J. Li. 2012. Finding maximal k-edge-connected subgraphs from a large graph. in EDBT (2012).","DOI":"10.1145\/2247596.2247652"}],"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.3380119","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3366423.3380119","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:00Z","timestamp":1750199580000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,20]]},"references-count":59,"alternative-id":["10.1145\/3366423.3380119","10.1145\/3366423"],"URL":"https:\/\/doi.org\/10.1145\/3366423.3380119","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"}}]}}