{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:37:16Z","timestamp":1760575036087,"version":"build-2065373602"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T00:00:00Z","timestamp":1749168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T00:00:00Z","timestamp":1749168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100020771","name":"Young Scientists Fund of the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["No. 42106190","No. 42106190","No. 42106190","No. 42106190","No. 42106190"],"award-info":[{"award-number":["No. 42106190","No. 42106190","No. 42106190","No. 42106190","No. 42106190"]}],"id":[{"id":"10.13039\/501100020771","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s10115-025-02482-7","type":"journal-article","created":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T08:14:26Z","timestamp":1749197666000},"page":"8787-8815","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A lossless graph summarization method for hierarchical and overlapping relational patterns mining"],"prefix":"10.1007","volume":"67","author":[{"given":"Danfeng","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoluo","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,6]]},"reference":[{"issue":"3","key":"2482_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961194","volume":"2","author":"F Bonchi","year":"2011","unstructured":"Bonchi F et al (2011) Social network analysis and mining for business applications. ACM Trans Intell Syst Technol 2(3):1\u201337","journal-title":"ACM Trans Intell Syst Technol"},{"key":"2482_CR2","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1016\/j.aaf.2023.03.005","volume":"9","author":"D Zhao","year":"2023","unstructured":"Zhao D et al (2023) Stability analysis of reef fish communities based on symbiotic graph model. Aquac Fish 9:1007\u20131017. https:\/\/doi.org\/10.1016\/j.aaf.2023.03.005","journal-title":"Aquac Fish"},{"issue":"2","key":"2482_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1089\/cmb.2008.11TT","volume":"16","author":"S Navlakha","year":"2009","unstructured":"Navlakha S, Schatz MC, Kingsford C (2009) Revealing biological modules via graph summarization. J Comput Biol 16(2):253\u2013264. https:\/\/doi.org\/10.1089\/cmb.2008.11TT","journal-title":"J Comput Biol"},{"issue":"18","key":"2482_CR4","doi-asserted-by":"publisher","first-page":"17393","DOI":"10.1007\/s11071-023-08762-7","volume":"111","author":"D Zhao","year":"2023","unstructured":"Zhao D et al (2023) Visibility graph analysis of the sea surface temperature irreversibility during El Ni\u00f1o events. Nonlinear Dyn 111(18):17393\u201317409. https:\/\/doi.org\/10.1007\/s11071-023-08762-7","journal-title":"Nonlinear Dyn"},{"issue":"3","key":"2482_CR5","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/mm.2006.49","volume":"26","author":"M Kistler","year":"2006","unstructured":"Kistler M, Perrone M, Petrini F (2006) Cell multiprocessor communication network: built for speed. IEEE Micro 26(3):10\u201323. https:\/\/doi.org\/10.1109\/mm.2006.49","journal-title":"IEEE Micro"},{"key":"2482_CR6","doi-asserted-by":"publisher","DOI":"10.1145\/3628430","author":"O Ullah","year":"2023","unstructured":"Ullah O et al (2023) On neuroevolution of multi-input compositional pattern producing networks: a case of entertainment computing, edge devices, and smart cities. ACM Trans Sen Netw. https:\/\/doi.org\/10.1145\/3628430","journal-title":"ACM Trans Sen Netw"},{"issue":"3\u20134","key":"2482_CR7","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/s0895-7177(00)00142-4","volume":"32","author":"A Nagurney","year":"2000","unstructured":"Nagurney A (2000) A multiclass, multicriteria traffic network equilibrium model. Math Comput Model 32(3\u20134):393\u2013411. https:\/\/doi.org\/10.1016\/s0895-7177(00)00142-4","journal-title":"Math Comput Model"},{"issue":"3","key":"2482_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3186727","volume":"51","author":"YK Liu","year":"2018","unstructured":"Liu YK et al (2018) Graph summarization methods and applications: a survey. ACM Comput Surv 51(3):1\u201334. https:\/\/doi.org\/10.1145\/3186727","journal-title":"ACM Comput Surv"},{"key":"2482_CR9","doi-asserted-by":"publisher","unstructured":"Yuan, Y., et al (2020) Efficient graph query processing over geo-distributed datacenters. In: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval ACM.https:\/\/doi.org\/10.1145\/3397271.3401157","DOI":"10.1145\/3397271.3401157"},{"issue":"16","key":"2482_CR10","doi-asserted-by":"publisher","first-page":"12650","DOI":"10.1109\/JIOT.2020.3021488","volume":"8","author":"W Luo","year":"2020","unstructured":"Luo W et al (2020) Efficient approaches to top-r influential community search. IEEE Internet of Things J 8(16):12650\u201312657. https:\/\/doi.org\/10.1109\/JIOT.2020.3021488","journal-title":"IEEE Internet of Things J"},{"key":"2482_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.ins.2021.04.027","volume":"572","author":"Y He","year":"2021","unstructured":"He Y et al (2021) Exploring cohesive subgraphs with vertex engagement and tie strength in bipartite graphs. Inf Sci 572:277\u2013296. https:\/\/doi.org\/10.1016\/j.ins.2021.04.027","journal-title":"Inf Sci"},{"key":"2482_CR12","doi-asserted-by":"publisher","DOI":"10.14778\/31377653137825","author":"A Khan","year":"2017","unstructured":"Khan A, Bhowmick SS, Bonchi F (2017) Summarizing static and dynamic big graphs. Proc VLDB Endow. https:\/\/doi.org\/10.14778\/31377653137825","journal-title":"Proc VLDB Endow"},{"key":"2482_CR13","doi-asserted-by":"publisher","first-page":"5584","DOI":"10.1109\/ACCESS.2023.3340984","volume":"12","author":"HT Javed","year":"2024","unstructured":"Javed HT et al (2024) Instance-based lossless summarization of knowledge graph with optimized triples and corrections (IBA-OTC). IEEE Access 12:5584\u20135604. https:\/\/doi.org\/10.1109\/ACCESS.2023.3340984","journal-title":"IEEE Access"},{"key":"2482_CR14","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.knosys.2023.110770","volume":"276","author":"MG Khan","year":"2023","unstructured":"Khan MG, Halim Z, Baig AR (2023) An efficient approach for faster matching of approximate patterns in graphs. Know Based Syst 276:12","journal-title":"Know Based Syst"},{"key":"2482_CR15","doi-asserted-by":"publisher","unstructured":"Jamil, S., et al (2011) Weighted MUSE for Frequent Sub-Graph Pattern Finding in Uncertain DBLP Data. In: 2011 International Conference on Internet Technology and Applications. IEEE.https:\/\/doi.org\/10.1109\/ITAP.2011.6006415","DOI":"10.1109\/ITAP.2011.6006415"},{"key":"2482_CR16","doi-asserted-by":"publisher","unstructured":"Navlakha, S., R. Rastogi, and N. Shrivastava (2008) Graph summarization with bounded error. In: Proceedings of the 2008 ACM SIGMOD international conference on Management of data. ACM.https:\/\/doi.org\/10.1145\/1376616.1376661","DOI":"10.1145\/1376616.1376661"},{"issue":"12","key":"2482_CR17","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1007\/s00607-015-0454-9","volume":"97","author":"KU Khan","year":"2015","unstructured":"Khan KU, Nawaz W, Lee Y-K (2015) Set-based approximate approach for lossless graph summarization. Computing 97(12):1185\u20131207. https:\/\/doi.org\/10.1007\/s00607-015-0454-9","journal-title":"Computing"},{"key":"2482_CR18","doi-asserted-by":"publisher","unstructured":"Shin, K., et al (2019) SWeG: Lossless and Lossy Summarization of Web-Scale Graphs. In: The World Wide Web Conference (WWW). San Francisco, CA: ACM. https:\/\/doi.org\/10.1145\/3308558.3313402","DOI":"10.1145\/3308558.3313402"},{"key":"2482_CR19","doi-asserted-by":"publisher","unstructured":"Lee, K., et al (2022) SLUGGER: Lossless Hierarchical Summarization of Massive Graphs. In: 38th IEEE International Conference on Data Engineering (ICDE). Electr Network: IEEE.https:\/\/doi.org\/10.1109\/icde53745.2022.00040","DOI":"10.1109\/icde53745.2022.00040"},{"key":"2482_CR20","doi-asserted-by":"publisher","unstructured":"Yong, Q., et al (2021) Efficient graph summarization using weighted lsh at billion-scale. In: Proceedings of the 2021 International Conference on Management of Data. ACM. https:\/\/doi.org\/10.1145\/3448016.3457331","DOI":"10.1145\/3448016.3457331"},{"key":"2482_CR21","doi-asserted-by":"publisher","unstructured":"Hajiabadi, M., et al (2021) Graph summarization with controlled utility loss. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. ACM. https:\/\/doi.org\/10.1145\/3447548.3467359","DOI":"10.1145\/3447548.3467359"},{"key":"2482_CR22","doi-asserted-by":"publisher","unstructured":"Kang, S., K. Lee, and K. Shin (2022) Personalized graph summarization: formulation, scalable algorithms, and applications. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE. https:\/\/doi.org\/10.1109\/ICDE53745.2022.00219","DOI":"10.1109\/ICDE53745.2022.00219"},{"key":"2482_CR23","doi-asserted-by":"publisher","unstructured":"Zhou, H., et al (2021) Dpgs: Degree-preserving graph summarization. In: Proceedings of the 2021 SIAM International Conference on Data Mining (SDM). SIAM. https:\/\/doi.org\/10.1137\/1.9781611976700.32","DOI":"10.1137\/1.9781611976700.32"},{"issue":"5","key":"2482_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3494561","volume":"16","author":"X Ke","year":"2022","unstructured":"Ke X, Khan A, Bonchi F (2022) Multi-relation graph summarization. ACM Trans Knowl Discov Data (TKDD) 16(5):1\u201330. https:\/\/doi.org\/10.1145\/3494561","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"2482_CR25","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.ins.2021.12.116","volume":"589","author":"Z Ma","year":"2022","unstructured":"Ma Z et al (2022) A parameter-free approach to lossless summarization of fully dynamic graphs. Inf Sci 589:376\u2013394. https:\/\/doi.org\/10.1016\/j.ins.2021.12.116","journal-title":"Inf Sci"},{"key":"2482_CR26","first-page":"985","volume":"11","author":"J Leskovec","year":"2010","unstructured":"Leskovec J et al (2010) Kronecker graphs: an approach to modeling networks. J Mach Learn Res 11:985\u20131042","journal-title":"J Mach Learn Res"},{"issue":"12","key":"2482_CR27","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826. https:\/\/doi.org\/10.1073\/pnas.122653799","journal-title":"Proc Natl Acad Sci"},{"issue":"39","key":"2482_CR28","doi-asserted-by":"publisher","first-page":"15224","DOI":"10.1073\/pnas.0703740104","volume":"104","author":"M Sales-Pardo","year":"2007","unstructured":"Sales-Pardo M et al (2007) Extracting the hierarchical organization of complex systems. Proc Natl Acad Sci 104(39):15224\u201315229. https:\/\/doi.org\/10.1073\/pnas.0703740104","journal-title":"Proc Natl Acad Sci"},{"issue":"11","key":"2482_CR29","doi-asserted-by":"publisher","first-page":"2681","DOI":"10.1039\/C3MB70236G","volume":"9","author":"SE Ahnert","year":"2013","unstructured":"Ahnert SE (2013) Power graph compression reveals dominant relationships in genetic transcription networks. Mol BioSyst 9(11):2681\u20132685. https:\/\/doi.org\/10.1039\/C3MB70236G","journal-title":"Mol BioSyst"},{"issue":"2","key":"2482_CR30","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1111\/j.1469-8137.1912.tb05611.x","volume":"11","author":"P Jaccard","year":"2006","unstructured":"Jaccard P (2006) The distribution of the flora in the alpine zone 1. New Phytol 11(2):37\u201350. https:\/\/doi.org\/10.1111\/j.1469-8137.1912.tb05611.x","journal-title":"New Phytol"},{"issue":"1","key":"2482_CR31","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R Sibson","year":"1973","unstructured":"Sibson R (1973) SLINK: an optimally efficient algorithm for the single-link cluster method. Comput J 16(1):30\u201334. https:\/\/doi.org\/10.1093\/comjnl\/16.1.30","journal-title":"Comput J"},{"issue":"5","key":"2482_CR32","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen J (1978) Modeling by shortest data description. Automatica 14(5):465\u2013471. https:\/\/doi.org\/10.1016\/0005-1098(78)90005-5","journal-title":"Automatica"},{"issue":"3","key":"2482_CR33","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/sam.11267","volume":"8","author":"D Koutra","year":"2015","unstructured":"Koutra D et al (2015) Summarizing and understanding large graphs. Stat Anal Data Min 8(3):183\u2013202. https:\/\/doi.org\/10.1002\/sam.11267","journal-title":"Stat Anal Data Min"},{"key":"2482_CR34","doi-asserted-by":"publisher","unstructured":"Hajiabadi, M., V. Srinivasan, and A. Thomo (2022) Dynamic Graph Summarization: Optimal and Scalable. In: 2022 IEEE International Conference on Big Data (Big Data). https:\/\/doi.org\/10.1109\/BigData55660.2022.10020422","DOI":"10.1109\/BigData55660.2022.10020422"},{"key":"2482_CR35","doi-asserted-by":"publisher","DOI":"10.14778\/35831403583154","author":"Z Jiang","year":"2023","unstructured":"Jiang Z, Chen H, Jin H (2023) Auxo: a scalable and efficient graph stream summarization structure. Proc VLDB Endow. https:\/\/doi.org\/10.14778\/35831403583154","journal-title":"Proc VLDB Endow"},{"key":"2482_CR36","doi-asserted-by":"publisher","unstructured":"Zhou, H., et al (2024) Graph Summarization for Preserving Spectral Characteristics https:\/\/doi.org\/10.1137\/1.9781611978032.31","DOI":"10.1137\/1.9781611978032.31"},{"issue":"3","key":"2482_CR37","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/3654943","volume":"2","author":"D Chu","year":"2024","unstructured":"Chu D et al (2024) Graph summarization: compactness meets efficiency. Proc ACM Manag Data 2(3):140. https:\/\/doi.org\/10.1145\/3654943","journal-title":"Proc ACM Manag Data"},{"key":"2482_CR38","doi-asserted-by":"crossref","unstructured":"Lefevre, K. and E. Terzi (2010) GraSS: Graph Structure Summarization. In: Proceedings of the 2010 SIAM International Conference on Data Mining (SDM). SIAM.","DOI":"10.1137\/1.9781611972801.40"},{"key":"2482_CR39","doi-asserted-by":"crossref","unstructured":"Riondato, M., D. Garc\u00eda-Soriano, and F. Bonchi (2014) Graph Summarization with Quality Guarantees. In: 2014 IEEE International Conference on Data Mining. IEEE.","DOI":"10.1109\/ICDM.2014.56"},{"key":"2482_CR40","doi-asserted-by":"crossref","unstructured":"Beg, M.A., et al (2018) Scalable approximation algorithm for graph summarization. In: Advances in Knowledge Discovery and Data Mining: 22nd Pacific-Asia Conference, PAKDD 2018, Melbourne, VIC, Australia, June 3\u20136, 2018, Proceedings, Part III. Springer.","DOI":"10.1007\/978-3-319-93040-4_40"},{"key":"2482_CR41","doi-asserted-by":"crossref","unstructured":"Lee, K., et al (2020) SSumM: Sparse Summarization of Massive Graphs. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. ACM","DOI":"10.1145\/3394486.3403057"},{"key":"2482_CR42","doi-asserted-by":"crossref","unstructured":"Merchant, A., M. Mathioudakis, and Y. Wang (2023) Graph Summarization via Node Grouping: A Spectral Algorithm, In: Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining. 2023, Association for Computing Machinery: Singapore, Singapore. p. 742\u2013750.","DOI":"10.1145\/3539597.3570441"},{"issue":"6","key":"2482_CR43","doi-asserted-by":"publisher","first-page":"5901","DOI":"10.1109\/TKDE.2022.3174570","volume":"35","author":"X Gou","year":"2023","unstructured":"Gou X et al (2023) Graph stream sketch: summarizing graph streams with high speed and accuracy. IEEE Trans Knowl Data Eng 35(6):5901\u20135914. https:\/\/doi.org\/10.1109\/TKDE.2022.3174570","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2482_CR44","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-018-0121-z","author":"RA Rossi","year":"2018","unstructured":"Rossi RA, Zhou R (2018) GraphZIP: a clique-based sparse graph compression method. J Big Data. https:\/\/doi.org\/10.1186\/s40537-018-0121-z","journal-title":"J Big Data"},{"issue":"6","key":"2482_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3522691","volume":"16","author":"J-G Jang","year":"2022","unstructured":"Jang J-G et al (2022) Finding key structures in MMORPG graph with hierarchical graph summarization. ACM Trans Knowl Discov Data (TKDD) 16(6):1\u201321. https:\/\/doi.org\/10.1145\/3522691","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"2482_CR46","doi-asserted-by":"publisher","first-page":"3780","DOI":"10.1109\/TAI.2024.3350545","volume":"5","author":"N Shabani","year":"2023","unstructured":"Shabani N et al (2023) A comprehensive survey on graph summarization with graph neural networks. IEEE Trans Artif Intell 5:3780\u20133800","journal-title":"IEEE Trans Artif Intell"},{"issue":"4","key":"2482_CR47","doi-asserted-by":"publisher","first-page":"4946","DOI":"10.1609\/aaai.v37i4.25621","volume":"37","author":"H Zhou","year":"2023","unstructured":"Zhou H et al (2023) A provable framework of learning graph embeddings via summarization. Proc AAAI Conf Artif Intell 37(4):4946\u20134953. https:\/\/doi.org\/10.1609\/aaai.v37i4.25621","journal-title":"Proc AAAI Conf Artif Intell"},{"issue":"3","key":"2482_CR48","doi-asserted-by":"publisher","first-page":"6224","DOI":"10.1109\/TCE.2024.3411993","volume":"70","author":"N Shabani","year":"2024","unstructured":"Shabani N et al (2024) Attention-based graph summarization for large-scale information retrieval. IEEE Trans Consum Electron 70(3):6224\u20136235. https:\/\/doi.org\/10.1109\/TCE.2024.3411993","journal-title":"IEEE Trans Consum Electron"},{"key":"2482_CR49","unstructured":"Shabani, N., et al (2024) GraphSUM: Scalable Graph Summarization for Efficient Question Answering. In: International Conference on Extending Database Technology"},{"issue":"10","key":"2482_CR50","doi-asserted-by":"publisher","first-page":"2432","DOI":"10.14778\/3675034.3675037","volume":"17","author":"J Bai","year":"2024","unstructured":"Bai J, Zhao P (2024) Poligras: policy-based graph summarization. Proc VLDB Endow 17(10):2432\u2013244","journal-title":"Proc VLDB Endow"},{"key":"2482_CR51","doi-asserted-by":"crossref","unstructured":"Li, M. and P.M.B. Vit\u00e1nyi (1997) An Introduction to Kolmogorov Complexity and Its Applications, Third Edition. Texts in Computer Science","DOI":"10.1007\/978-1-4757-2606-0"},{"key":"2482_CR52","doi-asserted-by":"publisher","unstructured":"Hagberg, A.A., et al (2008) Exploring Network Structure, Dynamics, and Function using NetworkX. Proceedings of the Python in Science Conference https:\/\/doi.org\/10.25080\/TCWV9851","DOI":"10.25080\/TCWV9851"},{"issue":"9","key":"2482_CR53","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) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575\u2013577. https:\/\/doi.org\/10.1145\/362342.362367","journal-title":"Commun ACM"},{"issue":"1","key":"2482_CR54","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"},{"issue":"1","key":"2482_CR55","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.tcs.2008.05.010","volume":"407","author":"F Cazals","year":"2008","unstructured":"Cazals F, Karande C (2008) A note on the problem of reporting maximal cliques. Theor Comput Sci 407(1):564\u2013568. https:\/\/doi.org\/10.1016\/j.tcs.2008.05.010","journal-title":"Theor Comput Sci"},{"issue":"1","key":"2482_CR56","doi-asserted-by":"publisher","first-page":"5233","DOI":"10.1038\/s41598-019-41695-z","volume":"9","author":"VA Traag","year":"2019","unstructured":"Traag VA, Waltman L, van Eck NJ (2019) From louvain to leiden: guaranteeing well-connected communities. Sci Rep 9(1):5233. https:\/\/doi.org\/10.1038\/s41598-019-41695-z","journal-title":"Sci Rep"},{"key":"2482_CR57","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD et al (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp. https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/P10008","journal-title":"J Stat Mech Theory Exp"},{"key":"2482_CR58","unstructured":"Leskovec, J. and A. Krevl (2014) SNAP Datasets: Stanford Large Network Dataset Collection. 2014\/6; Available from: http:\/\/snap.stanford.edu\/data."},{"key":"2482_CR59","doi-asserted-by":"publisher","unstructured":"Leskovec, J. and E. Horvitz 2008 Planetary-scale views on a large instant-messaging network. In: Proceedings of the 17th international conference on World Wide Web. Beijing, China: Association for Computing Machinery.https:\/\/doi.org\/10.1145\/1367497.1367620","DOI":"10.1145\/1367497.1367620"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02482-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-025-02482-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02482-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T10:56:36Z","timestamp":1760525796000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-025-02482-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,6]]},"references-count":59,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2482"],"URL":"https:\/\/doi.org\/10.1007\/s10115-025-02482-7","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2025,6,6]]},"assertion":[{"value":"13 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}