{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:23:28Z","timestamp":1772119408698,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T00:00:00Z","timestamp":1636329600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T00:00:00Z","timestamp":1636329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s00500-021-06468-9","type":"journal-article","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T06:03:44Z","timestamp":1636351424000},"page":"55-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Truss decomposition using triangle graphs"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1172-1941","authenticated-orcid":false,"given":"Mohsen","family":"Rezvani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mojtaba","family":"Rezvani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,8]]},"reference":[{"key":"6468_CR1","doi-asserted-by":"crossref","unstructured":"Almasri M, Anjum O, Pearson C, Qureshi Z, Mailthody VS, Nagi R, Xiong J, Hwu W-m (2019) Update on k-truss decomposition on gpu. In: 2019 IEEE high performance extreme computing conference (HPEC), pp 1\u20137","DOI":"10.1109\/HPEC.2019.8916285"},{"key":"6468_CR2","doi-asserted-by":"crossref","unstructured":"Arifuzzaman S, Khan M, Marathe M (2013) PATRIC: a parallel algorithm for counting triangles in massive networks. In: Proceedings of CIKM, pp 529\u2013538. ACM","DOI":"10.1145\/2505515.2505545"},{"key":"6468_CR3","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Chu S, Ozsu MT (2011) Efficient core decomposition in massive networks. In: Proceedings of ICDE, pp 51\u201362. IEEE","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"6468_CR4","doi-asserted-by":"publisher","unstructured":"Cho E, Myers SA, Leskovec J (2011) Friendship and mobility: user movement in location-based social networks. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201911). Association for Computing Machinery, New York, NY, USA, pp 1082\u20131090. https:\/\/doi.org\/10.1145\/2020408.2020579","DOI":"10.1145\/2020408.2020579"},{"key":"6468_CR5","doi-asserted-by":"crossref","unstructured":"Chu S, Cheng J (2011) Triangle listing in massive networks and its applications. In: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 672\u2013680","DOI":"10.1145\/2020408.2020513"},{"key":"6468_CR6","unstructured":"Cohen J (2008) Trusses: cohesive subgraphs for social network analysis. National Security Agency Technical Report"},{"issue":"4","key":"6468_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/MCSE.2009.120","volume":"11","author":"J Cohen","year":"2009","unstructured":"Cohen J (2009) Graph twiddling in a mapreduce world. Comput Sci Eng 11(4):29\u201341","journal-title":"Comput Sci Eng"},{"key":"6468_CR8","doi-asserted-by":"publisher","first-page":"139096","DOI":"10.1109\/ACCESS.2020.3011667","volume":"8","author":"A Conte","year":"2020","unstructured":"Conte A, De Sensi D, Grossi R, Marino A, Versari L (2020) Truly scalable k-truss and max-truss algorithms for community detection in graphs. IEEE Access 8:139096\u2013139109","journal-title":"IEEE Access"},{"key":"6468_CR9","doi-asserted-by":"crossref","unstructured":"Conte A, De\u00a0Sensi D, Grossi R, Marino A, Versari L (2018) Discovering k-trusses in large-scale networks. In: 2018 IEEE high performance extreme computing conference (HPEC), pp 1\u20136","DOI":"10.1109\/HPEC.2018.8547735"},{"issue":"1","key":"6468_CR10","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00778-019-00556-x","volume":"29","author":"Y Fang","year":"2020","unstructured":"Fang Y, Xin Huang L, Qin YZ, Zhang W, Cheng R, Lin X (2020) A survey of community search over big graphs. VLDB J 29(1):353\u2013392","journal-title":"VLDB J"},{"key":"6468_CR11","doi-asserted-by":"crossref","unstructured":"Ghosh S, Halappanavar M (2020) TriC: distributed-memory triangle counting by exploiting the graph structure. In: 2020 IEEE high performance extreme computing conference (HPEC), pp 1\u20136","DOI":"10.1109\/HPEC43674.2020.9286167"},{"key":"6468_CR12","doi-asserted-by":"publisher","first-page":"148841","DOI":"10.1109\/ACCESS.2020.3016214","volume":"8","author":"MA Habib Wafaa","year":"2020","unstructured":"Habib Wafaa MA, Mokhtar Hoda MO, El-Sharkawi ME (2020) Weight-based k-truss community search via edge attachment. IEEE Access 8:148841\u2013148852","journal-title":"IEEE Access"},{"key":"6468_CR13","unstructured":"Hanneman RA, Riddle M (2005) Introduction to social network methods. University of California"},{"key":"6468_CR14","doi-asserted-by":"crossref","unstructured":"Huang S, El-Hadedy M, Hao C, Li Q, Mailthody VS, Date K, Xiong J, Deming C, Rakesh N, Wen-mei H (2018) Triangle counting and truss decomposition using FPGA. In: 2018 IEEE high performance extreme computing conference (HPEC), pp 1\u20137. IEEE","DOI":"10.1109\/HPEC.2018.8547536"},{"key":"6468_CR15","doi-asserted-by":"crossref","unstructured":"Hu X, Tao Y, Chung C-W (2013) Massive graph triangulation. In: Proceedings of SIGMOD, pp 325\u2013336. ACM","DOI":"10.1145\/2463676.2463704"},{"key":"6468_CR16","doi-asserted-by":"publisher","unstructured":"Jiang Y, Huang X, Cheng H (2021) I\/O efficient $$k$$-truss community search in massive graphs. VLDB J 30:713\u2013738. https:\/\/doi.org\/10.1007\/s00778-020-00649-y","DOI":"10.1007\/s00778-020-00649-y"},{"key":"6468_CR17","doi-asserted-by":"crossref","unstructured":"Kong Y-X, Shi G-Y, Rui-Jie W, Zhang Y-C (2019) k-core: theories and applications. Physics reports","DOI":"10.1016\/j.physrep.2019.10.004"},{"key":"6468_CR18","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: stanford large network dataset collection. http:\/\/snap.stanford.edu\/data, June"},{"key":"6468_CR19","unstructured":"Leskovec J, Mcauley JJ (2012) Learning to discover social circles in ego networks. In: Advances in neural information processing systems, pp 539\u2013547"},{"issue":"1","key":"6468_CR20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00778-019-00587-4","volume":"29","author":"FD Malliaros","year":"2020","unstructured":"Malliaros FD, Giatsidis C, Papadopoulos AN, Vazirgiannis M (2020) The core decomposition of networks: theory, algorithms and applications. VLDB J 29(1):61\u201392","journal-title":"VLDB J"},{"key":"6468_CR21","unstructured":"MIT\/Amazon\/IEEE. GraphChallenge. https:\/\/graphchallenge.mit.edu\/. [Online; accessed 11-August-2020]"},{"key":"6468_CR22","doi-asserted-by":"crossref","unstructured":"Pandey S, Li XS, Buluc A, Xu J, Liu H (2019) H-INDEX: hash-indexing for parallel triangle counting on GPUs. In: 2019 IEEE high performance extreme computing conference (HPEC), pp 1\u20137","DOI":"10.1109\/HPEC.2019.8916492"},{"key":"6468_CR23","doi-asserted-by":"crossref","unstructured":"Park H-M, Chung C-W (2013) An efficient mapreduce algorithm for counting triangles in a very large graph. In: Proceedings of CIKM, pp 539\u2013548. ACM","DOI":"10.1145\/2505515.2505563"},{"key":"6468_CR24","doi-asserted-by":"crossref","unstructured":"Pearce R, Sanders G (2018) K-truss decomposition for scale-free graphs at scale in distributed memory. In: 2018 IEEE high performance extreme computing conference (HPEC), pp 1\u20136. IEEE","DOI":"10.1109\/HPEC.2018.8547572"},{"key":"6468_CR25","doi-asserted-by":"crossref","unstructured":"Quick L, Wilkinson P, Hardcastle D (2012) Using pregel-like large scale graph processing frameworks for social network analysis. In: Proceedings of ASONAM, pp 457\u2013463","DOI":"10.1109\/ASONAM.2012.254"},{"issue":"5","key":"6468_CR26","doi-asserted-by":"publisher","first-page":"509","DOI":"10.14778\/2735479.2735484","volume":"8","author":"L Rong-Hua","year":"2015","unstructured":"Rong-Hua L, Qin L, Yu Jeffrey X, Rui M (2015) Influential community search in large networks. Proc VLDB Endowment 8(5):509\u2013520","journal-title":"Proc VLDB Endowment"},{"key":"6468_CR27","doi-asserted-by":"crossref","unstructured":"Schank T, Wagner D (2005) Finding, counting and listing all triangles in large graphs, an experimental study. In: Proceedings of WEA, pp 606\u2013609","DOI":"10.1007\/11427186_54"},{"key":"6468_CR28","doi-asserted-by":"crossref","unstructured":"Shao Y, Chen L, Cui B (2014) Efficient cohesive subgraphs detection in parallel network analysis. In: Proceedings of SIGMOD","DOI":"10.1145\/2588555.2593665"},{"key":"6468_CR29","doi-asserted-by":"crossref","unstructured":"Smith S, Liu X, Ahmed NK, Tom AS, Petrini F, Karypis G (2017) Truss decomposition on shared-memory parallel systems. In: 2017 IEEE high performance extreme computing conference (HPEC), pp 1\u20136. IEEE","DOI":"10.1109\/HPEC.2017.8091049"},{"key":"6468_CR30","doi-asserted-by":"crossref","unstructured":"Tangwongsan K, Pavan A, Tirthapura S (2013) Parallel triangle counting in massive streaming graphs. In: Proceedings of CIKM, pp 781\u2013786. ACM","DOI":"10.1145\/2505515.2505741"},{"key":"6468_CR31","doi-asserted-by":"crossref","unstructured":"Wang J, Cheng J (2012) Truss decomposition in massive networks. In: Proceedings of VLDB, pp 812\u2013823","DOI":"10.14778\/2311906.2311909"},{"issue":"1","key":"6468_CR32","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42(1):181\u2013213","journal-title":"Knowl Inf Syst"},{"key":"6468_CR33","doi-asserted-by":"crossref","unstructured":"Yin H, Benson AR, Leskovec J, Gleich DF (2017) Local higher-order graph clustering. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pp 555\u2013564","DOI":"10.1145\/3097983.3098069"},{"key":"6468_CR34","doi-asserted-by":"crossref","unstructured":"Zhao F, Tung Anthony KH (2012) Large scale cohesive subgraphs discovery for social network visual analysis. In: Proceedings of VLDB, pp 85\u201396","DOI":"10.14778\/2535568.2448942"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06468-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-06468-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06468-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,5]],"date-time":"2022-01-05T09:14:42Z","timestamp":1641374082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-06468-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,8]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["6468"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-06468-9","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-819379\/v1","asserted-by":"object"}]},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,8]]},"assertion":[{"value":"21 October 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Author A, <i>Mohsen Rezvani<\/i>, declares that he has no conflict of interest. Author B, <i>Mojtaba Rezvani<\/i>, declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}