{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T06:42:50Z","timestamp":1764225770943,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T00:00:00Z","timestamp":1655683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T00:00:00Z","timestamp":1655683200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["20ZR1402700"],"award-info":[{"award-number":["20ZR1402700"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472339","61873337"],"award-info":[{"award-number":["61472339","61873337"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s11227-022-04613-1","type":"journal-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T16:03:12Z","timestamp":1655740992000},"page":"19372-19400","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Index-based top k \u03b1-maximal-clique enumeration over uncertain graphs"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9400-6029","authenticated-orcid":false,"given":"Jing","family":"Bai","sequence":"first","affiliation":[]},{"given":"Junfeng","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Ming","family":"Du","sequence":"additional","affiliation":[]},{"given":"Ziyang","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,20]]},"reference":[{"key":"4613_CR1","unstructured":"Gibson D, Kumar R, Tomkins A (2005) Discovering large dense subgraphs in massive graphs. In: Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30 - September 2, 2005, pp. 721\u2013732 http:\/\/www.vldb.org\/archives\/website\/2005\/program\/paper\/thu\/p721-gibson.pdf"},{"key":"4613_CR2","doi-asserted-by":"publisher","unstructured":"Qin L, Li R, Chang L, Zhang C (2015) Locally densest subgraph discovery. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Sydney, NSW, Australia, August 10-13, 2015, pp. 965\u2013974 https:\/\/doi.org\/10.1145\/2783258.2783299","DOI":"10.1145\/2783258.2783299"},{"key":"4613_CR3","unstructured":"Modani N, Dey K (2009) Large maximal cliques enumeration in large sparse graphs. In: Chawla, S., Karlapalem, K., Pudi, V. (eds.) Proceedings of the 15th International Conference on Management of Data, December 9-12, 2009, International School of Information Management, Mysore, India. Computer Society of India, India. http:\/\/www.cse.iitb.ac.in\/%7Ecomad\/2009\/proceedings\/R3_1.pdf"},{"key":"4613_CR4","doi-asserted-by":"publisher","unstructured":"Makino K, Uno T (2004) New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings. Lecture Notes in Computer Science, vol. 3111, pp. 260\u2013272. Springer, Germany. https:\/\/doi.org\/10.1007\/978-3-540-27810-8_23","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"4613_CR5","doi-asserted-by":"publisher","unstructured":"Mukherjee AP, Xu P, Tirthapura S (2015) Mining maximal cliques from an uncertain graph. In: 31st IEEE International Conference on Data Engineering, ICDE 2015, Seoul, South Korea, April 13-17, 2015, pp. 243\u2013254. https:\/\/doi.org\/10.1109\/ICDE.2015.7113288","DOI":"10.1109\/ICDE.2015.7113288"},{"key":"4613_CR6","doi-asserted-by":"publisher","unstructured":"Zou Z, Li J, Gao H, Zhang S (2010) Finding top-k maximal cliques in an uncertain graph. In: Proceedings of the 26th International Conference on Data Engineering, ICDE 2010, March 1-6, 2010, Long Beach, California, USA, pp. 649\u2013652 https:\/\/doi.org\/10.1109\/ICDE.2010.5447891","DOI":"10.1109\/ICDE.2010.5447891"},{"key":"4613_CR7","doi-asserted-by":"publisher","unstructured":"Li R, Dai Q, Wang G, Ming Z, Qin L, Yu JX (2019) Improved algorithms for maximal clique search in uncertain networks. In: 35th IEEE International Conference on Data Engineering, ICDE 2019, Macao, China, April 8-11, 2019, pp. 1178\u20131189. IEEE, New York https:\/\/doi.org\/10.1109\/ICDE.2019.00108","DOI":"10.1109\/ICDE.2019.00108"},{"issue":"4","key":"4613_CR8","doi-asserted-by":"publisher","first-page":"3129","DOI":"10.3233\/JIFS-18263","volume":"36","author":"A Rashid","year":"2019","unstructured":"Rashid A, Kamran M, Halim Z (2019) A top down approach to enumerate$$\\alpha$$-maximal cliques in uncertain graphs. J Intell Fuzzy Syst 36(4):3129\u20133141. https:\/\/doi.org\/10.3233\/JIFS-18263","journal-title":"J Intell Fuzzy Syst"},{"key":"4613_CR9","doi-asserted-by":"publisher","unstructured":"M\u00e1rquez R, Weber R (2019) Overlapping community detection in static and dynamic social networks. In: Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, WSDM 2019, Melbourne, VIC, Australia, February 11-15, 2019, pp. 822\u2013823 https:\/\/doi.org\/10.1145\/3289600.3291602","DOI":"10.1145\/3289600.3291602"},{"key":"4613_CR10","doi-asserted-by":"publisher","unstructured":"Xiao D, Du N, Wu B, Wang B (2007) Community ranking in social network. In: Proceeding of the Second International Multi-Symposium of Computer and Computational Sciences (IMSCCS 2007), August 13-15, 2007, The University of Iowa, Iowa City, Iowa, USA, pp. 322\u2013329. IEEE Computer Society, Los Alamitos, CA, USA https:\/\/doi.org\/10.1109\/IMSCCS.2007.31","DOI":"10.1109\/IMSCCS.2007.31"},{"key":"4613_CR11","doi-asserted-by":"publisher","unstructured":"Meena J, Devi VS (2015) Overlapping community detection in social network using disjoint community detection. In: IEEE Symposium Series on Computational Intelligence, SSCI 2015, Cape Town, South Africa, December 7-10, 2015, pp. 764\u2013771 https:\/\/doi.org\/10.1109\/SSCI.2015.114","DOI":"10.1109\/SSCI.2015.114"},{"key":"4613_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ins.2017.01.026","volume":"388","author":"L Bai","year":"2017","unstructured":"Bai L, Cheng X, Liang J, Guo Y (2017) Fast graph clustering with a new description model for community detection. Inf Sci 388:37\u201347. https:\/\/doi.org\/10.1016\/j.ins.2017.01.026","journal-title":"Inf Sci"},{"key":"4613_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jnca.2013.08.008","volume":"40","author":"M Arab","year":"2014","unstructured":"Arab M, Afsharchi M (2014) Community detection in social networks using hybrid merging of sub-communities. J Netw Comput Appl 40:73\u201384. https:\/\/doi.org\/10.1016\/j.jnca.2013.08.008","journal-title":"J Netw Comput Appl"},{"key":"4613_CR14","doi-asserted-by":"crossref","unstructured":"Newman M, EJ (2001)The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences of the United States of America","DOI":"10.1073\/pnas.98.2.404"},{"issue":"2","key":"4613_CR15","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1109\/TCSS.2018.2831694","volume":"5","author":"N Alduaiji","year":"2018","unstructured":"Alduaiji N, Datta A, Li J (2018) Influence propagation model for clique-based community detection in social networks. IEEE Trans Comput Soc Syst 5(2):563\u2013575. https:\/\/doi.org\/10.1109\/TCSS.2018.2831694","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"4613_CR16","doi-asserted-by":"publisher","unstructured":"Cheng J, Ke Y, Fu AW, Yu JX, Zhu L (201) Finding maximal cliques in massive networks by h*-graph. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, Indianapolis, Indiana, USA, June 6-10, 2010, pp. 447\u2013458 https:\/\/doi.org\/10.1145\/1807167.1807217","DOI":"10.1145\/1807167.1807217"},{"key":"4613_CR17","doi-asserted-by":"publisher","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28 - July 1, 2009, pp. 199\u2013208 https:\/\/doi.org\/10.1145\/1557019.1557047","DOI":"10.1145\/1557019.1557047"},{"key":"4613_CR18","doi-asserted-by":"publisher","unstructured":"Pathak N, Mane S, Srivastava J (2006) Who thinks who knows who? Socio-cognitive analysis of email networks. In: Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 18-22 December 2006, Hong Kong, China, pp. 466\u2013477 https:\/\/doi.org\/10.1109\/ICDM.2006.168","DOI":"10.1109\/ICDM.2006.168"},{"key":"4613_CR19","doi-asserted-by":"publisher","unstructured":"Hooi B, Song HA, Beutel A, Shah N, Shin K, Faloutsos C (2016) FRAUDAR: Bounding graph fraud in the face of camouflage. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA, August 13-17, 2016, pp. 895\u2013904 https:\/\/doi.org\/10.1145\/2939672.2939747","DOI":"10.1145\/2939672.2939747"},{"issue":"9","key":"4613_CR20","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J (1973) Finding all cliques of an undirected graph (algorithm 457). Commun ACM 16(9):575\u2013576","journal-title":"Commun ACM"},{"issue":"1","key":"4613_CR21","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita E, Tanaka A, Takahashi H (2006) The worst-case time complexity for generating all maximal cliques and computational experiments. Theor Comput Sci 363(1):28\u201342. https:\/\/doi.org\/10.1016\/j.tcs.2006.06.015","journal-title":"Theor Comput Sci"},{"key":"4613_CR22","doi-asserted-by":"publisher","DOI":"10.1145\/2543629","author":"D Eppstein","year":"2013","unstructured":"Eppstein D, L\u00f6ffler M, Strash D (2013) Listing all maximal cliques in large sparse real-world graphs. ACM J Exp Algorithmics. https:\/\/doi.org\/10.1145\/2543629","journal-title":"ACM J Exp Algorithmics"},{"key":"4613_CR23","doi-asserted-by":"publisher","unstructured":"Aggarwal CC (2009) Managing and Mining Uncertain Data. Advances in Database Systems, vol. 35. Kluwer, Netherlands https:\/\/doi.org\/10.1007\/978-0-387-09690-2","DOI":"10.1007\/978-0-387-09690-2"},{"issue":"2","key":"4613_CR24","first-page":"15","volume":"30","author":"E Adar","year":"2007","unstructured":"Adar E, R\u00e9 C (2007) Managing uncertainty in social networks. IEEE Data Eng Bull 30(2):15\u201322","journal-title":"IEEE Data Eng Bull"},{"issue":"7","key":"4613_CR25","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg JM (2007) The link-prediction problem for social networks. J Assoc Inf Sci Technol 58(7):1019\u20131031. https:\/\/doi.org\/10.1002\/asi.20591","journal-title":"J Assoc Inf Sci Technol"},{"key":"4613_CR26","doi-asserted-by":"publisher","unstructured":"Liben-Nowell D, Kleinberg JM (2003) The link prediction problem for social networks. In: Proceedings of the 2003 ACM CIKM International Conference on Information and Knowledge Management, New Orleans, Louisiana, USA, November 2-8, 2003, pp. 556\u2013559 https:\/\/doi.org\/10.1145\/956863.956972","DOI":"10.1145\/956863.956972"},{"issue":"11","key":"4613_CR27","doi-asserted-by":"publisher","first-page":"1376","DOI":"10.14778\/2350229.2350254","volume":"5","author":"P Boldi","year":"2012","unstructured":"Boldi P, Bonchi F, Gionis A, Tassa T (2012) Injecting uncertainty in graphs for identity obfuscation. Proc VLDB Endow 5(11):1376\u20131387","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"4613_CR28","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/1754393.1754397","volume":"10","author":"U Kuter","year":"2010","unstructured":"Kuter U, Golbeck J (2010) Using probabilistic confidence models for trust inference in web-based social networks. ACM Trans Internet Techn 10(2):8\u20131823. https:\/\/doi.org\/10.1145\/1754393.1754397","journal-title":"ACM Trans Internet Techn"},{"key":"4613_CR29","doi-asserted-by":"publisher","unstructured":"Mehmood Y, Bonchi F, Garc\u00eda-Soriano D (2016) Spheres of influence for more effective viral marketing. In: Proceedings of the 2016 International Conference on Management of Data, SIGMOD Conference 2016, San Francisco, CA, USA, June 26 - July 01, 2016, pp. 711\u2013726 https:\/\/doi.org\/10.1145\/2882903.2915250","DOI":"10.1145\/2882903.2915250"},{"key":"4613_CR30","doi-asserted-by":"publisher","unstructured":"Kawahigashi H, Terashima Y, Miyauchi N, Nakakawaji T (2005) Modeling ad hoc sensor networks using random graph theory. In: 2nd IEEE Consumer Communications and Networking Conference, CCNC 2005, Las Vegas, NV, USA, January 3-6, pp. 104\u2013109 (2005). https:\/\/doi.org\/10.1109\/CCNC.2005.1405152","DOI":"10.1109\/CCNC.2005.1405152"},{"key":"4613_CR31","doi-asserted-by":"publisher","unstructured":"Yang B, Wen D, Qin L, Zhang Y, Chang L, Li R (2019) Index-based optimal algorithm for computing k-cores in large uncertain graphs. In: 35th IEEE International Conference on Data Engineering, ICDE 2019, Macao, China, April 8-11, 2019, pp. 64\u201375. IEEE, New York https:\/\/doi.org\/10.1109\/ICDE.2019.00015","DOI":"10.1109\/ICDE.2019.00015"},{"key":"4613_CR32","unstructured":"Abu-khzam FN, Baldwin NE, Langston MA, Samatova NF (2005) On the relative efficiency of maximal clique enumeration algorithms, with application to high-throughput. In: Computational Biology, Proceedings, International Conference on Research Trends in Science and Technology"},{"issue":"2","key":"4613_CR33","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1089\/cmb.1996.3.289","volume":"3","author":"I Koch","year":"1996","unstructured":"Koch I, Lengauer T, Wanke E (1996) An algorithm for finding maximal common subtopologies in a set of protein structures. J Comput Biol 3(2):289\u2013306. https:\/\/doi.org\/10.1089\/cmb.1996.3.289","journal-title":"J Comput Biol"},{"key":"4613_CR34","doi-asserted-by":"publisher","unstructured":"Saha B, Hoch A, Khuller S, Raschid L, Zhang X (2010) Dense subgraphs with restrictions and applications to gene annotation graphs. In: Research in Computational Molecular Biology, 14th Annual International Conference, RECOMB 2010, Lisbon, Portugal, April 25-28, 2010. Proceedings, pp. 456\u2013472 https:\/\/doi.org\/10.1007\/978-3-642-12683-3_30","DOI":"10.1007\/978-3-642-12683-3_30"},{"issue":"7062","key":"4613_CR35","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1038\/nature04209","volume":"437","author":"JF Rual","year":"2005","unstructured":"Rual JF, Venkatesan K, Tong H, Hirozane-Kishikawa T, Dricot A, Li N, Berriz GF, Gibbons FD, Dreze M, Ayivi-Guedehoussou N (2005) Towards a proteome-scale map of the human protein-protein interaction network. Nature 437(7062):1173\u20138","journal-title":"Nature"},{"issue":"10","key":"4613_CR36","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1038\/nrg2159","volume":"8","author":"Weidong Wang","year":"2007","unstructured":"Wang Weidong (2007) Emergence of a dna-damage response network consisting of fanconi anaemia and brca proteins. Nat Rev Genet 8(10):735","journal-title":"Nat Rev Genet"},{"issue":"6","key":"4613_CR37","doi-asserted-by":"publisher","first-page":"2986","DOI":"10.3837\/tiis.2019.06.012","volume":"13","author":"Y Lu","year":"2019","unstructured":"Lu Y, Huang R, Huang D (2019) Mining highly reliable dense subgraphs from uncertain graphs. KSII Trans Internet Inf Syst 13(6):2986\u20132999. https:\/\/doi.org\/10.3837\/tiis.2019.06.012","journal-title":"KSII Trans Internet Inf Syst"},{"key":"4613_CR38","doi-asserted-by":"publisher","unstructured":"Yuan L, Qin L, Lin X, Chang L, Zhang W (2015) Diversified top-k clique search. In: 31st IEEE International Conference on Data Engineering, ICDE 2015, Seoul, South Korea, April 13-17, 2015, pp. 387\u2013398 (2015). https:\/\/doi.org\/10.1109\/ICDE.2015.7113300","DOI":"10.1109\/ICDE.2015.7113300"},{"key":"4613_CR39","doi-asserted-by":"publisher","unstructured":"Sanei-Mehri S, Das A, Tirthapura S (2018) Enumerating top-k quasi-cliques. In: IEEE International Conference on Big Data, Big Data 2018, Seattle, WA, USA, December 10-13, 2018, pp. 1107\u20131112 https:\/\/doi.org\/10.1109\/BigData.2018.8622352","DOI":"10.1109\/BigData.2018.8622352"},{"key":"4613_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104867","volume":"116","author":"J Wu","year":"2020","unstructured":"Wu J, Li C, Jiang L, Zhou J, Yin M (2020) Local search for diversified top-k clique search problem. Comput Op Res 116:104867. https:\/\/doi.org\/10.1016\/j.cor.2019.104867","journal-title":"Comput Op Res"},{"key":"4613_CR41","doi-asserted-by":"crossref","unstructured":"Zhao-Nian Z, Rong Z (2013) Mining top-k maximal cliques from large uncertain graphs. In: 2013 Chinese Jounrnal of Computers, pp. 2146\u20132155. CCF","DOI":"10.3724\/SP.J.1016.2013.02146"},{"key":"4613_CR42","doi-asserted-by":"publisher","first-page":"149338","DOI":"10.1109\/ACCESS.2021.3125198","volume":"9","author":"J Bai","year":"2021","unstructured":"Bai J, Zhou J, Du M, Zhong P (2021) Efficient (k, $$\\alpha$$)-maximal-cliques enumeration over uncertain graphs. IEEE Access 9:149338\u2013149348. https:\/\/doi.org\/10.1109\/ACCESS.2021.3125198","journal-title":"IEEE Access"},{"issue":"6","key":"4613_CR43","first-page":"34","volume":"1","author":"V Batagelj","year":"2003","unstructured":"Batagelj V, Zaversnik M (2003) An o(m) algorithm for cores decomposition of networks. Comput Sci 1(6):34\u201337","journal-title":"Comput Sci"},{"issue":"10","key":"4613_CR44","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.14778\/3401960.3401971","volume":"13","author":"Y Che","year":"2020","unstructured":"Che Y, Lai Z, Sun S, Wang Y, Luo Q (2020) Accelerating truss decomposition on heterogeneous processors. Proc VLDB Endow 13(10):1751\u20131764","journal-title":"Proc VLDB Endow"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04613-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04613-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04613-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T11:32:24Z","timestamp":1666870344000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04613-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,20]]},"references-count":44,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["4613"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04613-1","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,6,20]]},"assertion":[{"value":"15 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}