{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:08:57Z","timestamp":1755839337834,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP170104747, DP180100212, DP200103700"],"award-info":[{"award-number":["DP170104747, DP180100212, DP200103700"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,10]]},"DOI":"10.1145\/3514221.3517881","type":"proceedings-article","created":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T02:33:49Z","timestamp":1655001229000},"page":"2006-2019","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["One Set to Cover All Maximal Cliques Approximately"],"prefix":"10.1145","author":[{"given":"Xiaofan","family":"Li","sequence":"first","affiliation":[{"name":"Swinburne University of Technology, Melbourne, VIC, Australia"}]},{"given":"Rui","family":"Zhou","sequence":"additional","affiliation":[{"name":"Swinburne University of Technology, Melbourne, VIC, Australia"}]},{"given":"Lu","family":"Chen","sequence":"additional","affiliation":[{"name":"Swinburne University of Technology, Melbourne, VIC, Australia"}]},{"given":"Chengfei","family":"Liu","sequence":"additional","affiliation":[{"name":"Swinburne University of Technology, Melbourne, VIC, Australia"}]},{"given":"Qiang","family":"He","sequence":"additional","affiliation":[{"name":"Swinburne University of Technology, Melbourne, VIC, Australia"}]},{"given":"Yun","family":"Yang","sequence":"additional","affiliation":[{"name":"Swinburne University of Technology, Melbourne, VIC, Australia"}]}],"member":"320","published-online":{"date-parts":[[2022,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22953-4_16"},{"key":"e_1_3_2_1_2_1","volume-title":"The AAAI-04 Workshop on Agent Organizations: Theory and Practice. 1198--1208","author":"Berry Nina","year":"2004","unstructured":"Nina Berry, Teresa Ko, Tim Moy, Julienne Smrcka, Jessica Turnley, and Ben Wu. 2004. Emergent clique formation in terrorist recruitment. In The AAAI-04 Workshop on Agent Organizations: Theory and Practice. 1198--1208."},{"key":"e_1_3_2_1_3_1","volume-title":"Informatica","volume":"39","author":"B\u00f3ta Andr\u00e1s","year":"2015","unstructured":"Andr\u00e1s B\u00f3ta and Mikl\u00f3s Kr\u00e9sz. 2015. A high resolution clique-based overlapping community detection algorithm for small-world networks. Informatica, Vol. 39, 2 (2015)."},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330986"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9632-8"},{"key":"e_1_3_2_1_7_1","volume-title":"International Conference on Machine Learning. PMLR, 804--813","author":"Chen Lin","year":"2018","unstructured":"Lin Chen, Moran Feldman, and Amin Karbasi. 2018. Weakly submodular maximization beyond cardinality constraints: Does randomization help greedy?. In International Conference on Machine Learning. PMLR, 804--813."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807217"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339724"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1108\/14684521211275984"},{"key":"e_1_3_2_1_11_1","volume-title":"Trusses: Cohesive subgraphs for social network analysis. National security agency technical report","author":"Cohen Jonathan","year":"2008","unstructured":"Jonathan Cohen. 2008. Trusses: Cohesive subgraphs for social network analysis. National security agency technical report, Vol. 16, 3.1 (2008)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00540-5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2010\/12\/P12037"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_16_1","volume-title":"Non-submodular function maximization subject to a matroid constraint, with applications. arXiv preprint arXiv:1811.07863","author":"Gatmiry Khashayar","year":"2018","unstructured":"Khashayar Gatmiry and Manuel Gomez-Rodriguez. 2018. Non-submodular function maximization subject to a matroid constraint, with applications. arXiv preprint arXiv:1811.07863 (2018)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2011.65"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3294052.3319691"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8621868"},{"volume-title":"Complexity of computer computations","author":"Karp Richard M","key":"e_1_3_2_1_20_1","unstructured":"Richard M Karp. 1972. Reducibility among combinatorial problems. In Complexity of computer computations. Springer, 85--103."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.12.1198"},{"key":"e_1_3_2_1_23_1","volume-title":"Uncovering the overlapping community structure of complex networks by maximal cliques. Physica A: Statistical Mechanics and its Applications","author":"Li Junqiu","year":"2014","unstructured":"Junqiu Li, Xingyuan Wang, and Yaozu Cui. 2014. Uncovering the overlapping community structure of complex networks by maximal cliques. Physica A: Statistical Mechanics and its Applications, Vol. 415 (2014), 398--406."},{"volume-title":"2019 IEEE 35th International Conference on Data Engineering (ICDE). 1178--1189","author":"Li R.","key":"e_1_3_2_1_24_1","unstructured":"R. Li, Q. Dai, G. Wang, Z. Ming, L. Qin, and J. X. Yu. 2019 a. Improved algorithms for maximal clique search in uncertain networks. In 2019 IEEE 35th International Conference on Data Engineering (ICDE). 1178--1189."},{"key":"e_1_3_2_1_25_1","volume-title":"Efficiently finding a maximal clique summary via effective sampling. arXiv preprint arXiv:2009.10376","author":"Li Xiaofan","year":"2020","unstructured":"Xiaofan Li, Rui Zhou, Lu Chen, Chengfei Liu, Qiang He, and Yun Yang. 2020. Efficiently finding a maximal clique summary via effective sampling. arXiv preprint arXiv:2009.10376 (2020)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00120"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00147"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2952082"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137660"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02760024"},{"volume-title":"2015 IEEE 31st International Conference on Data Engineering (ICDE). 243--254","author":"Mukherjee A. P.","key":"e_1_3_2_1_31_1","unstructured":"A. P. Mukherjee, P. Xu, and S. Tirthapura. 2015. Mining maximal cliques from an uncertain graph. In 2015 IEEE 31st International Conference on Data Engineering (ICDE). 243--254."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.11.016"},{"key":"e_1_3_2_1_33_1","volume-title":"An analysis of approximations for maximizing submodular set functions-I. Mathematical programming","author":"Nemhauser George L","year":"1978","unstructured":"George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. 1978. An analysis of approximations for maximizing submodular set functions-I. Mathematical programming, Vol. 14, 1 (1978), 265--294."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00290-6"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature03607"},{"volume-title":"2012 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining. IEEE","author":"Reid F.","key":"e_1_3_2_1_36_1","unstructured":"F. Reid, A. McDaid, and N. Hurley. 2012. Percolation computation in complex networks. In 2012 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining. IEEE, Istanbul, 274--281."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl308"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.12.006"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.01.003"},{"key":"e_1_3_2_1_40_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."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:COAP.0000008651.28952.b6"},{"volume-title":"2017 IEEE 33rd International Conference on Data Engineering (ICDE). 115--118","author":"Sun S.","key":"e_1_3_2_1_42_1","unstructured":"S. Sun, Y. Wang, W. Liao, and W. Wang. 2017. Mining maximal cliques on dynamic graphs efficiently by local strategies. In 2017 IEEE 33rd International Conference on Data Engineering (ICDE). 115--118."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487689"},{"key":"e_1_3_2_1_45_1","first-page":"363","article-title":"A maximal clique based multiobjective evolutionary algorithm for overlapping community detection","volume":"21","author":"Wen Xuyun","year":"2016","unstructured":"Xuyun Wen, Wei-Neng Chen, Ying Lin, Tianlong Gu, Huaxiang Zhang, Yun Li, Yilong Yin, and Jun Zhang. 2016. A maximal clique based multiobjective evolutionary algorithm for overlapping community detection. IEEE Transactions on Evolutionary Computation, Vol. 21, 3 (2016), 363--377.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.3938\/jkps.75.436"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2015.2479225"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0408-z"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.10.018"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btn036"},{"volume-title":"2019 IEEE 35th International Conference on Data Engineering (ICDE). 878--889","author":"Zhang C.","key":"e_1_3_2_1_51_1","unstructured":"C. Zhang, Y. Zhang, W. Zhang, L. Qin, and J. Yang. 2019. Efficient maximal spatial clique enumeration. In 2019 IEEE 35th International Conference on Data Engineering (ICDE). 878--889."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247652"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401961"},{"volume-title":"2010 IEEE 26th International Conference on Data Engineering (ICDE). 649--652","author":"Zou Z.","key":"e_1_3_2_1_54_1","unstructured":"Z. Zou, J. Li, H. Gao, and S. Zhang. 2010. Finding top-k maximal cliques in an uncertain graph. In 2010 IEEE 26th International Conference on Data Engineering (ICDE). 649--652."}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22"},"container-title":["Proceedings of the 2022 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3517881","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3514221.3517881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:36Z","timestamp":1750188636000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3517881"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,10]]},"references-count":54,"alternative-id":["10.1145\/3514221.3517881","10.1145\/3514221"],"URL":"https:\/\/doi.org\/10.1145\/3514221.3517881","relation":{},"subject":[],"published":{"date-parts":[[2022,6,10]]},"assertion":[{"value":"2022-06-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}