{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:38:53Z","timestamp":1740123533837,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T00:00:00Z","timestamp":1664496000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T00:00:00Z","timestamp":1664496000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s11227-022-04835-3","type":"journal-article","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T08:04:02Z","timestamp":1664525042000},"page":"4791-4819","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fast parallel algorithms for finding elementary circuits of a directed graph: a GPU-based approach"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3798-5651","authenticated-orcid":false,"given":"Amira","family":"Benachour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sa\u00efd","family":"Yahiaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Didier","family":"El Baz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"Nouali-Taboudjemat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamamache","family":"Kheddouci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,30]]},"reference":[{"key":"4835_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.eswa.2016.09.029","volume":"67","author":"A Fronzetti Colladon","year":"2017","unstructured":"Fronzetti Colladon A, Remondi E (2017) Using social network analysis to prevent money laundering. Expert Syst Appl 67:49\u201358. https:\/\/doi.org\/10.1016\/j.eswa.2016.09.029","journal-title":"Expert Syst Appl"},{"issue":"4","key":"4835_CR2","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1046\/j.1461-0248.2002.00354.x","volume":"5","author":"JA Dunne","year":"2002","unstructured":"Dunne JA, Williams RJ, Martinez ND (2002) Network structure and biodiversity loss in food webs: robustness increases with connectance. Ecol Lett 5(4):558\u2013567. https:\/\/doi.org\/10.1046\/j.1461-0248.2002.00354.x","journal-title":"Ecol Lett"},{"key":"4835_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-319-95810-1_2","volume-title":"Applications of data management and analysis case studies in social networks and beyond","author":"A Bodaghi","year":"2018","unstructured":"Bodaghi A, Teimourpour B (2018) Automobile insurance fraud detection using social network analysis. Applications of data management and analysis case studies in social networks and beyond. Springer, Berlin, pp 11\u201316. https:\/\/doi.org\/10.1007\/978-3-319-95810-1_2"},{"key":"4835_CR4","doi-asserted-by":"publisher","unstructured":"Safar M, Mahdi K, Kassem A (2009) Universal cycles distribution function of social networks. In: 2009 First International Conference on Networked Digital Technologies, pp 354\u2013359. https:\/\/doi.org\/10.1109\/NDT.2009.5272805","DOI":"10.1109\/NDT.2009.5272805"},{"issue":"5","key":"4835_CR5","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1093\/comnet\/cnx005","volume":"5","author":"P-L Giscard","year":"2017","unstructured":"Giscard P-L, Rochet P, Wilson RC (2017) Evaluating balance on social networks from their simple cycles. J Complex Netw 5(5):750\u2013775. https:\/\/doi.org\/10.1093\/comnet\/cnx005","journal-title":"J Complex Netw"},{"issue":"1","key":"4835_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-8-430","volume":"8","author":"Y-K Kwon","year":"2007","unstructured":"Kwon Y-K, Cho K-H (2007) Analysis of feedback loops and robustness in network evolution based on boolean models. BMC Bioinform 8(1):1\u20139. https:\/\/doi.org\/10.1186\/1471-2105-8-430","journal-title":"BMC Bioinform"},{"issue":"1","key":"4835_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-10-181","volume":"10","author":"S Klamt","year":"2009","unstructured":"Klamt S, von Kamp A (2009) Computing paths and cycles in biological interaction graphs. BMC Bioinform 10(1):1\u201311. https:\/\/doi.org\/10.1186\/1471-2105-10-181","journal-title":"BMC Bioinform"},{"key":"4835_CR8","doi-asserted-by":"publisher","unstructured":"Chitturi B, Bein D, Grishin NV (2010) Complete enumeration of compact structural motifs in proteins. In: Proceedings of the International Symposium on Biocomputing, pp 1\u20138. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/1722024.1722047","DOI":"10.1145\/1722024.1722047"},{"key":"4835_CR9","doi-asserted-by":"publisher","unstructured":"Parasar M, Farrokhbakht H, Enright Jerger N, Gratz PV, Krishna T, San Miguel J (2020) Drain: deadlock removal for arbitrary irregular networks. In: 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA), pp 447\u2013460. https:\/\/doi.org\/10.1109\/HPCA47549.2020.00044","DOI":"10.1109\/HPCA47549.2020.00044"},{"issue":"12","key":"4835_CR10","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1145\/362814.362819","volume":"13","author":"JC Tiernan","year":"1970","unstructured":"Tiernan JC (1970) An efficient search algorithm to find the elementary circuits of a graph. Commun ACM 13(12):722\u2013726. https:\/\/doi.org\/10.1145\/362814.362819","journal-title":"Commun ACM"},{"issue":"3","key":"4835_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/0202017","volume":"2","author":"R Tarjan","year":"1973","unstructured":"Tarjan R (1973) Enumeration of the elementary circuits of a directed graph. SIAM J Comput 2(3):211\u2013216. https:\/\/doi.org\/10.1137\/0202017","journal-title":"SIAM J Comput"},{"issue":"1","key":"4835_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"DB Johnson","year":"1975","unstructured":"Johnson DB (1975) Finding all the elementary circuits of a directed graph. SIAM J Comput 4(1):77\u201384. https:\/\/doi.org\/10.1137\/0204007","journal-title":"SIAM J Comput"},{"key":"4835_CR13","doi-asserted-by":"publisher","unstructured":"Lu W, Zhao Q, Zhou C (2018) A parallel algorithm for finding all elementary circuits of a directed graph. In: 2018 37th Chinese Control Conference (CCC), pp 3156\u20133161. https:\/\/doi.org\/10.23919\/ChiCC.2018.8482857. IEEE","DOI":"10.23919\/ChiCC.2018.8482857"},{"issue":"7","key":"4835_CR14","doi-asserted-by":"publisher","first-page":"2716","DOI":"10.1007\/s00453-019-00552-1","volume":"81","author":"P-L Giscard","year":"2019","unstructured":"Giscard P-L, Kriege N, Wilson RC (2019) A general purpose algorithm for counting simple cycles and simple paths of any length. Algorithmica 81(7):2716\u20132737. https:\/\/doi.org\/10.1007\/s00453-019-00552-1","journal-title":"Algorithmica"},{"key":"4835_CR15","doi-asserted-by":"publisher","unstructured":"Gupta A, Suzumura T (2021) Finding all bounded-length simple cycles in a directed graph. CoRR. https:\/\/doi.org\/10.48550\/ARXIV.2105.10094","DOI":"10.48550\/ARXIV.2105.10094"},{"key":"4835_CR16","doi-asserted-by":"crossref","unstructured":"Mahdi F, Safar M, Mahdi K (2011) Detecting cycles in graphs using parallel capabilities of gpu. In: International Conference on Digital Information and Communication Technology and Its Applications, pp 193\u2013205. Springer","DOI":"10.1007\/978-3-642-22027-2_17"},{"key":"4835_CR17","doi-asserted-by":"crossref","unstructured":"Rungta S, Srivastava S, Yadav US, Rastogi R (2014) A comparative analysis of new approach with an existing algorithm to detect cycles in a directed graph. In: ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India-Vol II, Springer, pp 37\u201347","DOI":"10.1007\/978-3-319-03095-1_5"},{"key":"4835_CR18","unstructured":"Rocha RC, Thatte BD (2015) Distributed cycle detection in large-scale sparse graphs. In: Proceedings of Simp\u00f3sio Brasileiro de Pesquisa Operacional (SBPO\u201915), pp 1\u201311"},{"issue":"4","key":"4835_CR19","doi-asserted-by":"publisher","first-page":"115","DOI":"10.3390\/a10040115","volume":"10","author":"H Cui","year":"2017","unstructured":"Cui H, Niu J, Zhou C, Shu M (2017) A multi-threading algorithm to detect and remove cycles in vertex-and arc-weighted digraph. Algorithms 10(4):115","journal-title":"Algorithms"},{"key":"4835_CR20","unstructured":"Xu-guang L, Da-ming Z (2010) An approximation algorithm for the shortest cycle in an undirected unweighted graph. In: 2010 International Conference on Computer, Mechatronics, Control and Electronic Engineering, vol. 1, pp 297\u2013300. IEEE"},{"issue":"21\u201322","key":"4835_CR21","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1016\/j.ipl.2011.07.019","volume":"111","author":"R Yuster","year":"2011","unstructured":"Yuster R (2011) A shortest cycle for each vertex of a graph. Inf Process Lett 111(21\u201322):1057\u20131061","journal-title":"Inf Process Lett"},{"issue":"2","key":"4835_CR22","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1109\/TCOMM.2012.100912.120503","volume":"61","author":"M Karimi","year":"2012","unstructured":"Karimi M, Banihashemi AH (2012) Message-passing algorithms for counting short cycles in a graph. IEEE Trans Commun 61(2):485\u2013495","journal-title":"IEEE Trans Commun"},{"issue":"1","key":"4835_CR23","doi-asserted-by":"publisher","first-page":"179","DOI":"10.7151\/dmgt.1354","volume":"27","author":"D Paulusma","year":"2007","unstructured":"Paulusma D, Yoshimito K (2007) Cycles through specified vertices in triangle-free graphs. Discuss Math Graph Theory 27(1):179\u2013191","journal-title":"Discuss Math Graph Theory"},{"key":"4835_CR24","unstructured":"Li B, Zhang S (2011) Heavy subgraph conditions for longest cycles to be heavy in graphs. arXiv preprint arXiv:1109.4675"},{"key":"4835_CR25","doi-asserted-by":"crossref","unstructured":"Li B, Xiong L, Yin J (2016) Large degree vertices in longest cycles of graphs, i. Discuss Math Graph Theory 36(2)","DOI":"10.7151\/dmgt.1861"},{"issue":"2","key":"4835_CR26","doi-asserted-by":"publisher","first-page":"277","DOI":"10.5614\/ejgta.2019.7.2.7","volume":"7","author":"B Li","year":"2019","unstructured":"Li B, Xiong L, Yin J (2019) Large degree vertices in longest cycles of graphs, ii. Electron J Graph Theory Appl (EJGTA) 7(2):277\u2013299","journal-title":"Electron J Graph Theory Appl (EJGTA)"},{"issue":"1","key":"4835_CR27","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/321679.321684","volume":"19","author":"H Weinblatt","year":"1972","unstructured":"Weinblatt H (1972) A new search algorithm for finding the simple cycles of a finite directed graph. J ACM 19(1):43\u201356. https:\/\/doi.org\/10.1145\/321679.321684","journal-title":"J ACM"},{"key":"4835_CR28","doi-asserted-by":"publisher","unstructured":"Liu H, Wang J (2006) A new way to enumerate cycles in graph. In: Advanced Int\u2019l Conference on Telecommunications and Int\u2019l Conference on Internet and Web Applications and Services (AICT-ICIW\u201906), pp 57\u201357. https:\/\/doi.org\/10.1109\/AICT-ICIW.2006.22. IEEE","DOI":"10.1109\/AICT-ICIW.2006.22"},{"key":"4835_CR29","doi-asserted-by":"publisher","unstructured":"Sankar K, Sarad A (2007) A time and memory efficient way to enumerate cycles in a graph. In: 2007 International Conference on Intelligent and Advanced Systems, pp 498\u2013500. https:\/\/doi.org\/10.1109\/ICIAS.2007.4658438. IEEE","DOI":"10.1109\/ICIAS.2007.4658438"},{"issue":"5","key":"4835_CR30","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(85)90024-9","volume":"20","author":"JH Reif","year":"1985","unstructured":"Reif JH (1985) Depth-first search is inherently sequential. Inf Process Lett 20(5):229\u2013234. https:\/\/doi.org\/10.1016\/0020-0190(85)90024-9","journal-title":"Inf Process Lett"},{"key":"4835_CR31","doi-asserted-by":"crossref","unstructured":"Qing Z., Yuan L, Chen Z, Lin J, Ma G (2020) Efficient parallel cycle search in large graphs. In: International Conference on Database Systems for Advanced Applications. Springer, pp 349\u2013367","DOI":"10.1007\/978-3-030-59416-9_21"},{"key":"4835_CR32","unstructured":"Williamson, EABSG. Lists, Decisions and Graphs. S. Gill Williamson. https:\/\/books.google.dz\/books?id=vaXv_yhefG8C"},{"issue":"2","key":"4835_CR33","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan R (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2):146\u2013160. https:\/\/doi.org\/10.1137\/0201010","journal-title":"SIAM J Comput"},{"issue":"39","key":"4835_CR34","first-page":"851","volume":"3","author":"M Harris","year":"2007","unstructured":"Harris M, Sengupta S, Owens JD (2007) Parallel prefix sum (scan) with cuda. GPU Gems 3(39):851\u2013876","journal-title":"GPU Gems"},{"issue":"2","key":"4835_CR35","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s11390-019-1914-z","volume":"34","author":"C-Y Gui","year":"2019","unstructured":"Gui C-Y, Zheng L, He B, Liu C, Chen X-Y, Liao X-F, Jin H (2019) A survey on graph processing accelerators: challenges and opportunities. J Comput Sci Technol 34(2):339\u2013371. https:\/\/doi.org\/10.1007\/s11390-019-1914-z","journal-title":"J Comput Sci Technol"},{"key":"4835_CR36","doi-asserted-by":"publisher","first-page":"130048","DOI":"10.1109\/ACCESS.2020.3009577","volume":"8","author":"R Angles","year":"2020","unstructured":"Angles R, Paredes R, Garc\u00eda R (2020) R3MAT: a rapid and robust graph generator. IEEE Access 8:130048\u2013130065. https:\/\/doi.org\/10.1109\/ACCESS.2020.3009577","journal-title":"IEEE Access"},{"key":"4835_CR37","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) KONECT \u2013 The Koblenz Network Collection. http:\/\/konect.cc\/networks\/","DOI":"10.1145\/2487788.2488173"},{"key":"4835_CR38","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"key":"4835_CR39","doi-asserted-by":"crossref","unstructured":"Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. http:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"4835_CR40","unstructured":"Batagelj V, Mrvar A (2006) Pajek datasets. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/"},{"key":"4835_CR41","doi-asserted-by":"publisher","unstructured":"Chakrabarti D, Zhan Y, Faloutsos C (2004) R-mat: a recursive model for graph mining. In: Proceedings of the 2004 SIAM International Conference on Data Mining (SDM), pp 442\u2013446. https:\/\/doi.org\/10.1137\/1.9781611972740.43. SIAM","DOI":"10.1137\/1.9781611972740.43"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04835-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04835-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04835-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T09:25:11Z","timestamp":1676625911000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04835-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,30]]},"references-count":41,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["4835"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04835-3","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,9,30]]},"assertion":[{"value":"11 September 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}